A note on total colorings of planar graphs without 4-cycles
From MaRDI portal
Recommendations
Cited in
(30)- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
- Total coloring of planar graphs with maximum degree 7
- Total coloring of claw-free planar graphs
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- On total chromatic number of planar graphs without 4-cycles
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Total colorings of planar graphs without chordal 6-cycles
- Total coloring of planar graphs without chordal 7-cycles
- Hamiltonicity and generalised total colourings of planar graphs
- Total coloring of planar graphs without short cycles
- Total colorings of planar graphs with small maximum degree
- scientific article; zbMATH DE number 5525887 (Why is no real title available?)
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
- A note on the total coloring of planar graphs without adjacent 4-cycles
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
- Total colorings of planar graphs without intersecting 5-cycles
- Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
- scientific article; zbMATH DE number 7029178 (Why is no real title available?)
- Acyclic total colorings of planar graphs without \(l\) cycles
- Total coloring of planar graphs without 6-cycles
- Total coloring of embedded graphs of maximum degree at least ten
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- A note on complex-4-colorability of signed planar graphs
- List edge and list total colorings of planar graphs without 4-cycles
- Total colorings of planar graphs without small cycles
- Total colorings of planar graphs without adjacent triangles
This page was built for publication: A note on total colorings of planar graphs without 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4823300)
