Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2004.11.001 / rank
Normal rank
 
Property / author
 
Property / author: Oleg V. Borodin / rank
 
Normal rank
Property / author
 
Property / author: Andre Raspaud / rank
 
Normal rank
Property / author
 
Property / author: Mohammad R. Salavatipour / 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.1016/j.jctb.2004.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033177498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the three color problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2004.11.001 / rank
 
Normal rank

Latest revision as of 09:50, 11 December 2024

scientific article
Language Label Description Also known as
English
Planar graphs without cycles of length from 4 to 7 are 3-colorable
scientific article

    Statements

    Planar graphs without cycles of length from 4 to 7 are 3-colorable (English)
    0 references
    0 references
    0 references
    8 March 2005
    0 references
    Planar graphs
    0 references
    3-coloring
    0 references
    Steinberg's conjecture
    0 references

    Identifiers