The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.08.039 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015437014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / 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: 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \((p,q)\)-coloring of sparse plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115641 / 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: Distance constrained labelings of planar graphs with no short cycles / 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: Graph labellings with variable weights, a survey / 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: Choosability of the square of planar subcubic graphs with large girth / 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: List Colouring Squares of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115232 / 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: A survey on the distance-colouring of graphs / 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: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling planar graphs without 4-cycles with a condition on distance two / 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

Latest revision as of 00:47, 9 July 2024

scientific article
Language Label Description Also known as
English
The \(L(p, q)\)-labelling of planar graphs without 4-cycles
scientific article

    Statements

    The \(L(p, q)\)-labelling of planar graphs without 4-cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    \(L(p,q)\)-labelling
    0 references
    planar graphs
    0 references
    cycles
    0 references
    Wegner's conjecture
    0 references

    Identifiers