Some Conjectures and Questions in Chromatic Topological Graph Theory (Q5506783): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-319-31940-7_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2532678746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending precolorings of subgraphs of locally planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Planar Toroidal Graphs are 5-Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Chromatic Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is true for almost every graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beautiful conjectures in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-coloring graphs on the Klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Colorings of K5-Minor-Free Graphs With Special List Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally planar graphs are 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Proof of a Map-Colour Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and colorings of arrangement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Six Color Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring graphs embedded on surfaces with all faces even-sided / rank
 
Normal rank
Property / cites work
 
Property / cites work: On list-coloring outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Eulerian triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: 6-Critical Graphs on the Klein Bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning quadrangulations of triangulated surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5460903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring locally bipartite graphs on surfaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4595176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3261867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-coloring maps on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematica in Action / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:13, 13 July 2024

scientific article; zbMATH DE number 6664877
Language Label Description Also known as
English
Some Conjectures and Questions in Chromatic Topological Graph Theory
scientific article; zbMATH DE number 6664877

    Statements

    Some Conjectures and Questions in Chromatic Topological Graph Theory (English)
    0 references
    0 references
    0 references
    16 December 2016
    0 references
    planar graphs
    0 references
    chromatic number
    0 references
    list coloring
    0 references
    graph thickness
    0 references
    locally planar graph
    0 references
    great-circle graph
    0 references
    Hadwiger's conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers