Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Add wikidata reference.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-018-0647-9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(d,1)\)-labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(p,1)\)-labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Griggs and Yeh's Conjecture and $L(p,1)$-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling planar graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(p, q)\)-labelling of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal square coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound on 2-distance coloring plane graphs with girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring of subcubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3-choosability of plane graphs under distance restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio k-chromatic number of cycles for large k / rank
 
Normal rank
Property / cites work
 
Property / cites work: b-Chromatic sum of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the dichromatic number of a generalized lexicographic product of digraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-018-0647-9 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130043915 / rank
 
Normal rank

Latest revision as of 13:04, 16 December 2024

scientific article
Language Label Description Also known as
English
Optimal channel assignment and \(L(p,1)\)-labeling
scientific article

    Statements

    Optimal channel assignment and \(L(p,1)\)-labeling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2018
    0 references
    planar graph
    0 references
    cycle
    0 references
    labeling
    0 references

    Identifiers