Pages that link to "Item:Q4719323"
From MaRDI portal
The following pages link to Dirac's map-color theorem for choosability (Q4719323):
Displaying 27 items.
- 5-list-coloring planar graphs with distant precolored vertices (Q345086) (← links)
- Degree choosable signed graphs (Q512558) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- The 4-choosability of toroidal graphs without intersecting triangles (Q845970) (← links)
- Coloring vertices and faces of locally planar graphs (Q855294) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability (Q1598834) (← links)
- A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two (Q1682205) (← links)
- Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- Coloring Eulerian triangulations of the Klein bottle (Q1926035) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs (Q2259863) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← links)
- Beyond degree choosability (Q2401410) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- A map colour theorem for the union of graphs (Q2581497) (← links)
- Phase transition of degeneracy in minor-closed families (Q2689167) (← links)
- A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
- An Edge-Colored Version of Dirac's Theorem (Q4979820) (← links)
- Toroidal graphs containing neither nor 6‐cycles are 4‐choosable (Q5272640) (← links)
- The last excluded case of Dirac's map‐color theorem for choosability (Q5469029) (← links)
- Toroidal graphs without \(K_5^-\) and 6-cycles (Q6553178) (← links)
