On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995): 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.2009.02.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055901320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorable planar graphs without cycles of four lengths / 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: A sufficient condition for a planar graph to be 3-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4, 6, 8-cycles are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3-choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorable plane graphs without 5- and 7-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3-choosability of planar graphs without certain cycles / rank
 
Normal rank

Latest revision as of 07:25, 2 July 2024

scientific article
Language Label Description Also known as
English
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
scientific article

    Statements

    On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    0 references
    planar graphs
    0 references
    cycles
    0 references
    extendability
    0 references
    coloring
    0 references
    0 references