Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andre Raspaud / rank
 
Normal rank
Property / author
 
Property / author: Wei Fan 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-013-1308-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028677278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous coloring of edges and faces of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A six-color theorem for the edge-face coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge‐face chromatic number and edge chromatic number of simple plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simultaneous edge-face colorings of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A five-color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improving the edge-face coloring theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneously colouring the edges and faces of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4278795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-face choosability of plane graphs / rank
 
Normal rank

Latest revision as of 02:13, 9 July 2024

scientific article
Language Label Description Also known as
English
Plane graphs with maximum degree 6 are edge-face 8-colorable
scientific article

    Statements

    Plane graphs with maximum degree 6 are edge-face 8-colorable (English)
    0 references
    0 references
    0 references
    0 references
    19 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    plane graph
    0 references
    edge-face coloring
    0 references
    maximum degree
    0 references
    discharging
    0 references
    0 references