Pages that link to "Item:Q3798676"
From MaRDI portal
The following pages link to On the total coloring of planar graphs. (Q3798676):
Displaying 50 items.
- Weight of edges in normal plane maps (Q271617) (← links)
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- On the maximum weight of a sparse connected graph of given order and size (Q293629) (← links)
- Light subgraphs in graphs with average degree at most four (Q294570) (← links)
- On oriented relative clique number (Q324737) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- Total coloring of certain classes of product graphs (Q327644) (← links)
- An extension of Kotzig's theorem (Q339478) (← links)
- The number of colorings of planar graphs with no separating triangles (Q345111) (← links)
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps (Q383686) (← links)
- Total coloring of planar graphs with 7-cycles containing at most two chords (Q391771) (← links)
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← links)
- Total coloring of planar graphs with maximum degree 8 (Q393898) (← links)
- Describing 3-paths in normal plane maps (Q394206) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
- Small minors in dense graphs (Q427808) (← links)
- A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Describing short paths in plane graphs of girth at least 5 (Q472958) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- An improved upper bound on the linear 2-arboricity of planar graphs (Q501025) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- A note on the linear 2-arboricity of planar graphs (Q526220) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- List injective colorings of planar graphs (Q615993) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- Light edges in 3-connected 2-planar graphs with prescribed minimum degree (Q723598) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
- A larger family of planar graphs that satisfy the total coloring conjecture (Q742577) (← links)
- Four gravity results (Q864159) (← links)
- \([r,s,t]\)-colorings of graphs (Q864161) (← links)
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs (Q868364) (← links)
