Linear coloring of planar graphs without 4-cycles (Q354457): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wei Fan Wang / rank
Normal rank
 
Property / author
 
Property / author: Yi Qiao Wang / rank
Normal rank
 
Property / author
 
Property / author: Wei Fan Wang / rank
 
Normal rank
Property / author
 
Property / author: Yi Qiao Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-012-1149-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068900645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring a graph frugally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the linear chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of graphs embeddable in a surface of nonnegative characteristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear coloring of graphs / rank
 
Normal rank

Latest revision as of 16:13, 6 July 2024

scientific article
Language Label Description Also known as
English
Linear coloring of planar graphs without 4-cycles
scientific article

    Statements

    Linear coloring of planar graphs without 4-cycles (English)
    0 references
    19 July 2013
    0 references
    linear coloring
    0 references
    planar graph
    0 references
    cycle
    0 references
    maximum degree
    0 references
    0 references
    0 references

    Identifiers