Hyperbolic families and coloring graphs on surfaces (Q4560169): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128824071, #quickstatements; #temporary_batch_1723807531120
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963315901 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.06749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: You can't paint yourself into a corner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending colorings of locally planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph color extensions: When Hadwiger's conjecture and embeddings help / 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: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / 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: Five-coloring graphs on the Klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steinberg's conjecture is false / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-coloring graphs on surfaces with varying list-sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally planar graphs are 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map-Colour Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Colouring of Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-coloring embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing first-order properties for subclasses of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5-choosability of graphs with crossings far apart / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5-list-coloring planar graphs with distant precolored vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The non-existence of colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs without short non-bounding cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with fixed genus and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On list-coloring extendable outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / 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: Q4633930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the plane to higher surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-list-coloring graphs of girth at least five on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two / 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: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-coloring maps on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-coloring graphs on the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-list-coloring planar graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-critical graphs on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short list color proof of Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of a graph of girth 5 on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(k\)-colorings of a graph on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many 5-list-colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many 3-colorings of triangle-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128824071 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:49, 16 August 2024

scientific article; zbMATH DE number 6989114
Language Label Description Also known as
English
Hyperbolic families and coloring graphs on surfaces
scientific article; zbMATH DE number 6989114

    Statements

    Hyperbolic families and coloring graphs on surfaces (English)
    0 references
    0 references
    0 references
    5 December 2018
    0 references
    linear isoperimetric inequalities for graphs on surfaces
    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

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