Some Conjectures and Questions in Chromatic Topological Graph Theory
From MaRDI portal
Publication:5506783
Recommendations
- On topological relaxations of chromatic conjectures
- Topics in Chromatic Graph Theory
- scientific article; zbMATH DE number 3308988
- Some topological methods in graph coloring theory
- scientific article; zbMATH DE number 3251276
- On certain chromatic topological indices of some Mycielski graphs
- scientific article; zbMATH DE number 773170
- scientific article; zbMATH DE number 4108788
- Topology of Hom complexes and test graphs for bounding chromatic number
- scientific article; zbMATH DE number 742642
Cites work
- scientific article; zbMATH DE number 1802818 (Why is no real title available?)
- scientific article; zbMATH DE number 3144962 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3769646 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1021588 (Why is no real title available?)
- scientific article; zbMATH DE number 1030709 (Why is no real title available?)
- scientific article; zbMATH DE number 1156585 (Why is no real title available?)
- scientific article; zbMATH DE number 1542661 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 2187705 (Why is no real title available?)
- scientific article; zbMATH DE number 3195967 (Why is no real title available?)
- scientific article; zbMATH DE number 5785644 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- 6-Critical Graphs on the Klein Bottle
- A Six Color Problem
- A characterization of uniquely 2-list colorable graphs
- Beautiful conjectures in graph theory
- Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces
- Coloring locally bipartite graphs on surfaces.
- Coloring of locally planar graphs with one color class small
- Colouring Eulerian triangulations
- Every planar graph is 5-choosable
- Every planar map is four colorable
- Extending precolorings of subgraphs of locally planar graphs
- Five-coloring graphs on the Klein bottle
- Five-coloring maps on surfaces
- Formal proof - the four color theorem
- Graphs on surfaces
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Hadwiger's conjecture is true for almost every graph
- Hamiltonicity and colorings of arrangement graphs
- List colorings of \(K_5\)-minor-free graphs with special list assignments
- List colourings of planar graphs
- Locally Planar Toroidal Graphs are 5-Colorable
- Locally planar graphs are 5-choosable
- Mathematica in action. Problem solving through visualization and computation. With CD-ROM.
- On list-coloring outerplanar graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Short Proof of a Map-Colour Theorem
- Spanning quadrangulations of triangulated surfaces
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
- Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
- Three-coloring graphs embedded on surfaces with all faces even-sided
- Topics in Chromatic Graph Theory
Cited in
(4)
This page was built for publication: Some Conjectures and Questions in Chromatic Topological Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506783)
