On the public citation graph
ApproximateL(δ1,δ2,…,δt)‐coloring of trees and interval graphs
0 signed · 32 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.1006/jpdc.2002.1860openalex-snapshot
Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees
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/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.04.024openalex-snapshot
Labeling trees with a condition at distance two
inferredcites →https://doi.org/10.1016/j.jpdc.2004.06.006openalex-snapshot
Channel assignment for interference avoidance in honeycomb wireless networks
inferredcites →https://doi.org/10.1016/s0012-365x(02)00750-1openalex-snapshot
Labeling trees with a condition at distance two
inferredcites →https://doi.org/10.1016/s0012-365x(99)00400-8openalex-snapshot
On L(d,1)-labelings of graphs
inferredcites →https://doi.org/10.1023/a:1019146910724openalex-snapshot
Assigning codes in wireless networks: bounds and scaling properties
inferredcites →https://doi.org/10.1093/comjnl/47.2.193openalex-snapshot
Approximations for -Colorings of Graphs
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/infcom.1998.662943openalex-snapshot
Upper and lower bounds of a class of channel assignment problems in cellular networks
inferredcites →https://doi.org/10.1109/proc.1980.11899openalex-snapshot
Frequency assignment: Theory and applications
inferredcites →https://doi.org/10.1109/tc.1987.1676965openalex-snapshot
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
inferredcites →https://doi.org/10.1109/tpds.2003.1189581openalex-snapshot
Channel assignment with separation for interference avoidance in wireless networks
inferredcites →https://doi.org/10.1137/0405048openalex-snapshot
Labelling Graphs with a Condition at Distance 2
inferredcites →https://doi.org/10.1137/s0895480191223178openalex-snapshot
Labeling Chordal Graphs: Distance Two Condition
inferredcites →https://doi.org/10.1137/s0895480193245339openalex-snapshot
The $L(2,1)$-Labeling Problem on Graphs
inferredcites →https://doi.org/10.1145/800116.803776openalex-snapshot
Linear algorithms to recognize interval graphs and test for the consecutive ones property
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20286openalex-snapshot
On irreducible no‐hole L(2, 1)‐coloring of trees
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.akcej.2017.03.002openalex-snapshot
L(3,2,1)- and L(4,3,2,1)-labeling problems on interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.02.004openalex-snapshot
Labeling bipartite permutation graphs with a condition at distance two
inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.003openalex-snapshot
Linear and cyclic distance-three labellings of trees
inferred← citeshttps://doi.org/10.1109/ipdpsw59300.2023.00059openalex-snapshot
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP*
inferred← citeshttps://doi.org/10.1142/s1793830921500683openalex-snapshot
L(3,2,1)-Labeling problems on trapezoid graphs
inferred← citeshttps://doi.org/10.1142/s2661335223500077openalex-snapshot
L(3,2,1)-labeling problem of square of path
inferred← citeshttps://doi.org/10.11650/tjm.17.2013.1909openalex-snapshot
DISTANCE THREE LABELINGS FOR DIRECT PRODUCTS OF THREE COMPLETE GRAPHS
inferred← citeshttps://doi.org/10.11650/tjm.19.2015.4632openalex-snapshot
$L(3,2,1)$-LABELING FOR THE PRODUCT OF A COMPLETE GRAPH AND A CYCLE
inferred← citeshttps://doi.org/10.15803/ijnc.14.1_26openalex-snapshot
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
inferred← citeshttps://doi.org/10.3233/jifs-172195openalex-snapshot
L (3, 1, 1)-labeling numbers of square of paths, complete graphs and complete bipartite graphs
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.