On the public citation graph
On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
0 signed · 53 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199812)29:4<263::aid-jgt5>3.0.co;2-vopenalex-snapshot
Graph labeling and radio channel assignment
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf02592052openalex-snapshot
Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
inferredcites →https://doi.org/10.1016/0020-0190(91)90245-dopenalex-snapshot
An optimal greedy heuristic to color interval graphs
inferredcites →https://doi.org/10.1016/0166-218x(88)90032-7openalex-snapshot
Trapezoid graphs and their coloring
inferredcites →https://doi.org/10.1016/0166-218x(92)90296-mopenalex-snapshot
Distances in cocomparability graphs and their powers
inferredcites →https://doi.org/10.1016/0898-1221(93)90308-iopenalex-snapshot
Optimal greedy algorithms for indifference graphs
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/j.jpdc.2006.06.004openalex-snapshot
Conflict-free star-access in parallel memory systems
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1023/a:1009759916586openalex-snapshot
Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network
inferredcites →https://doi.org/10.1089/cmb.1995.2.139openalex-snapshot
Four Strikes Against Physical Mapping of DNA
inferredcites →https://doi.org/10.1093/comjnl/bxl018openalex-snapshot
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
inferredcites →https://doi.org/10.1109/71.615440openalex-snapshot
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
inferredcites →https://doi.org/10.1109/infcom.1994.337595openalex-snapshot
A class of scalable optical interconnection networks through discrete broadcast-select multi-domain WDM
inferredcites →https://doi.org/10.1109/tc.1978.1675122openalex-snapshot
Theoretical Limitations on the Efficient Use of Parallel Memories
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/0405048openalex-snapshot
Labelling Graphs with a Condition at Distance 2
inferredcites →https://doi.org/10.1137/0601025openalex-snapshot
The Complexity of Coloring Circular Arcs and Chords
inferredcites →https://doi.org/10.1137/s0895480104445307openalex-snapshot
Linear Orderings of Subfamilies of AT‐Free Graphs
inferredcites →https://doi.org/10.1137/s0895480191223178openalex-snapshot
Labeling Chordal Graphs: Distance Two Condition
inferredcites →https://doi.org/10.1137/s0895480193250125openalex-snapshot
Asteroidal Triple-Free Graphs
inferredcites →https://doi.org/10.1137/s0895480196306373openalex-snapshot
Realizing Interval Graphs with Size and Distance Constraints
inferredcites →https://doi.org/10.1145/321707.321710openalex-snapshot
Permutation Graphs and Transitive Graphs
inferredcites →https://doi.org/10.1145/322123.322125openalex-snapshot
A Linear Time Algorithm for Deciding Interval Graph Isomorphism
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.70014openalex-snapshot
χ‐Binding Functions for Squares of Convex Bipartite Graphs and Partite Testability for Bipartite Squares
inferred← citeshttps://doi.org/10.1007/978-3-031-35668-1_10openalex-snapshot
Minimization of Span in $$L(3,1)$$-Labeling for a Particular Type of Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-19754-3_8openalex-snapshot
L(2,1)-Labeling of Unigraphs
inferred← citeshttps://doi.org/10.1007/978-981-13-0761-4_32openalex-snapshot
Exact Algorithm for L(2, 1) Labeling of Cartesian Product Between Complete Bipartite Graph and Cycle
inferred← citeshttps://doi.org/10.1007/978-981-13-3250-0_2openalex-snapshot
Exact Algorithm for L(2, 1) Labeling of Cartesian Product Between Complete Bipartite Graph and Path
inferred← citeshttps://doi.org/10.1007/s11786-014-0180-2openalex-snapshot
L(2, 1)-Labeling of Permutation and Bipartite Permutation Graphs
inferred← citeshttps://doi.org/10.1007/s12190-014-0846-6openalex-snapshot
L(2,1)-labeling of interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.07.008openalex-snapshot
L(2,1) -labeling of perfect elimination bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.015openalex-snapshot
The L(2,1) -labeling of unigraphs
inferred← citeshttps://doi.org/10.1142/s1793830920500937openalex-snapshot
Coloring squares of graphs via vertex orderings
inferred← citeshttps://doi.org/10.1142/s1793830921500683openalex-snapshot
L(3,2,1)-Labeling problems on trapezoid graphs
inferred← citeshttps://doi.org/10.1142/s1793830921500932openalex-snapshot
L(3,1)-labeling of circulant graphs
inferred← citeshttps://doi.org/10.1142/s2661335222500034openalex-snapshot
L(2,1,1)-labeling of interval graphs
inferred← citeshttps://doi.org/10.1155/2021/9958077openalex-snapshot
Distance Two Surjective Labelling of Paths and Interval Graphs
inferred← citeshttps://doi.org/10.3233/jifs-171176openalex-snapshot
Surjective L (2, 1)-labeling of cycles and circular-arc graphs
inferred← citeshttps://doi.org/10.4018/978-1-5225-9380-5.ch007openalex-snapshot
L(h,k)-Labeling of Intersection Graphs
inferred← citeshttps://doi.org/10.5281/zenodo.187966openalex-snapshot
FIGURE 3 in Revision of the new wandering spider genus Ohvida and taxonomic remarks on Celaetycheus Simon, 1897 (Araneae: Ctenidae)
inferred← citeshttps://doi.org/10.7151/dmgt.2086openalex-snapshot
L(2,1)-labeling of circulant graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2426openalex-snapshot
$L(p,q)$-labeling of graphs with interval representations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.