Distance constraints on short cycles for 3-colorability of planar graphs (Q497344): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-014-1476-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069158404 / 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: Colorings of plane graphs: a survey / 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: Q4811813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A step towards the strong version of Havel's three color conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without triangles adjacent to cycles of length from 3 to 9 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: Signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for planar graphs to be 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without adjacent cycles of length at most seven are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of B. Grünbaum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation of Havel's 3-color problem / 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: On 3-colorability of planar graphs without adjacent short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-color theorem on plane graphs without 5-circuits / rank
 
Normal rank

Latest revision as of 20:08, 10 July 2024

scientific article
Language Label Description Also known as
English
Distance constraints on short cycles for 3-colorability of planar graphs
scientific article

    Statements

    Distance constraints on short cycles for 3-colorability of planar graphs (English)
    0 references
    24 September 2015
    0 references
    planar graphs
    0 references
    coloring
    0 references
    cycles
    0 references
    distance
    0 references
    adjacency
    0 references
    0 references
    0 references

    Identifiers

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