The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.disc.2014.03.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050317551 / 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: Plane graphs with maximum degree 6 are edge-face 8-colorable / 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: Edge-face coloring of plane graphs with maximum degree nine / 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
Property / cites work
 
Property / cites work: A seven-color theorem on edge-face coloring of plane graphs / rank
 
Normal rank

Latest revision as of 12:28, 8 July 2024

scientific article
Language Label Description Also known as
English
The edge-face choosability of plane graphs with maximum degree at least 9
scientific article

    Statements

    The edge-face choosability of plane graphs with maximum degree at least 9 (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2014
    0 references
    plane graph
    0 references
    coloring
    0 references
    edge-face choosability
    0 references
    maximum degree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references