Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Li-Gang Jin / rank
Normal rank
 
Property / author
 
Property / author: Ying-Li Kang / rank
Normal rank
 
Property / author
 
Property / author: Ying Qian Wang / rank
Normal rank
 
Property / author
 
Property / author: Li-Gang Jin / rank
 
Normal rank
Property / author
 
Property / author: Ying-Li Kang / rank
 
Normal rank
Property / author
 
Property / author: Ying Qian Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1702.07558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000782 / 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 triangles adjacent to cycles of length from 4 to 7 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: Steinberg's conjecture is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to the discharging method via graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-colorability of planar graphs without cycles of length 4, 6 and 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance constraints on short cycles for 3-colorability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 3-colorability of planar graphs without 4-, 7- and 9-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4-,5- and 8-cycles are 3-colorable / 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 / cites work
 
Property / cites work: Planar graphs without 4, 6, 8-cycles are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: 没有4至6-圈的平面图是(1,0,0)-可染的 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2595530386 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:30, 30 July 2024

scientific article; zbMATH DE number 6767177
Language Label Description Also known as
English
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable
scientific article; zbMATH DE number 6767177

    Statements

    Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 August 2017
    0 references
    plane graphs
    0 references
    3-colorability
    0 references
    Steinberg's conjecture
    0 references
    discharging
    0 references

    Identifiers

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