Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The subchromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with a large cochromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning into graphs with only small components / 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: Fixed-parameter algorithms for the cocoloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subgraphs without large components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 15-colouring of 3-space omitting distance one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the Gyárfás-Sumner conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective coloring revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring triangle-free planar graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some defective parameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extremal results in cochromatic and dichromatic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring Planar Graphs With Three Colours and No Large Monochromatic Components / 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: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcolorings and the subchromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grötzsch's theorem on 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded size components -- partitions and transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and girth of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dichromatic number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex critical r-dichromatic tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematical Coloring Book / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the measurable chromatic number of \({\mathbb{R}}\) / 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: 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: Q3208683 / rank
 
Normal rank

Latest revision as of 03:13, 13 July 2024

scientific article; zbMATH DE number 6664872
Language Label Description Also known as
English
Some of My Favorite Coloring Problems for Graphs and Digraphs
scientific article; zbMATH DE number 6664872

    Statements

    Some of My Favorite Coloring Problems for Graphs and Digraphs (English)
    0 references
    0 references
    16 December 2016
    0 references
    chromatic number
    0 references
    color classes
    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