Distance constrained labelings of planar graphs with no short cycles (Q967308): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57601461, #quickstatements; #temporary_batch_1710879948957
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2718334 / 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: Q4501549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable / 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: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring squares of planar graphs with girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling trees with a condition at distance two. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576665 / 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: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the channel assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem about the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Powers of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the span in channel assignment problems: Bounds, computing and counting / 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 Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Planar Graphs with Conditions on Girth and Distance Two / rank
 
Normal rank

Latest revision as of 19:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Distance constrained labelings of planar graphs with no short cycles
scientific article

    Statements

    Distance constrained labelings of planar graphs with no short cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    0 references
    \(L(p,q)\)-labeling
    0 references
    distance constrained labeling
    0 references
    planar graphs with no short cycles
    0 references
    0 references
    0 references