Pages that link to "Item:Q1937564"
From MaRDI portal
The following pages link to Colorings of plane graphs: a survey (Q1937564):
Displaying 50 items.
- The entire choosability of plane graphs (Q266053) (← links)
- Weight of edges in normal plane maps (Q271617) (← links)
- The weight of faces in normal plane maps (Q294568) (← links)
- I,F-partitions of sparse graphs (Q298327) (← links)
- Third case of the cyclic coloring conjecture (Q322178) (← links)
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
- An extension of Kotzig's theorem (Q339478) (← links)
- Steinberg's conjecture is false (Q345097) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- Describing 3-faces in normal plane maps with minimum degree 4 (Q394234) (← links)
- Describing faces in plane triangulations (Q394346) (← links)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 (Q396738) (← links)
- \(L(p,q)\)-labeling of a graph embeddable on the torus (Q400502) (← links)
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 (Q467650) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- On the weight of minor faces in triangle-free 3-polytopes (Q726639) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Entire coloring of plane graph with maximum degree eleven (Q740657) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- Graph polynomials and paintability of plane graphs (Q833000) (← links)
- Weight of 3-paths in sparse plane graphs (Q888584) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices (Q898158) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- The vertex-face weight of edges in 3-polytopes (Q901903) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5 (Q1642298) (← links)
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 (Q1649896) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- 2-distance coloring of planar graphs with girth 5 (Q1679523) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- Choosability with union separation (Q1690218) (← links)
- More about the height of faces in 3-polytopes (Q1708391) (← links)
- Injective chromatic number of outerplanar graphs (Q1722035) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- Low minor faces in 3-polytopes (Q1800413) (← links)
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations (Q1999749) (← links)
- Choosability with union separation of triangle-free planar graphs (Q2005734) (← links)
- Structure of edges in plane graphs with bounded dual edge weight (Q2032903) (← links)
- Tight description of faces in torus triangulations with minimum degree 5 (Q2058357) (← links)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- Coloring drawings of graphs (Q2073312) (← links)
- A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- On the largest planar graphs with everywhere positive combinatorial curvature (Q2101172) (← links)
- All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
