Pages that link to "Item:Q4715277"
From MaRDI portal
The following pages link to Structural theorem on plane graphs with application to the entire coloring number (Q4715277):
Displaying 28 items.
- The entire choosability of plane graphs (Q266053) (← links)
- Weight of edges in normal plane maps (Q271617) (← links)
- An analogue of Franklin's theorem (Q294562) (← links)
- An extension of Kotzig's theorem (Q339478) (← links)
- On doubly light triangles in plane graphs (Q383767) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 (Q396738) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Describing 4-paths in 3-polytopes with minimum degree 5 (Q511329) (← links)
- Upper bounds on the linear chromatic number of a graph (Q626759) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469) (← links)
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
- The edge-face choosability of plane graphs (Q1883606) (← links)
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable (Q2185811) (← links)
- The entire chromatic number of graphs embedded on the torus with large maximum degree (Q2402264) (← links)
- The entire coloring of series-parallel graphs (Q2577645) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
- Facial list colourings of plane graphs (Q2629297) (← links)
- Entire \((\varDelta +2)\)-colorability of plane graphs (Q2637243) (← links)
- Entire coloring of 2-connected plane graphs (Q2662784) (← links)
- <i>M</i>-degrees of quadrangle-free planar graphs (Q3605161) (← links)
- Plane Graphs with Maximum Degree Are Entirely ‐Colorable (Q5325942) (← links)
- Simultaneous coloring of vertices and incidences of outerplanar graphs (Q6109789) (← links)
- Light 3-faces in 3-polytopes without adjacent triangles (Q6635125) (← links)
