On total 9-coloring planar graphs of maximum degree seven
From MaRDI portal
Recommendations
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Total coloring of planar graphs with maximum degree seven
- On the total coloring of planar graphs.
- Total coloring of planar graphs with maximum degree 7
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Cites work
Cited in
(72)- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- The total chromatic number of regular graphs of high degree
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- 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
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
- Planar graphs are \(9/2\)-colorable
- Planar graphs of maximum degree seven are Class I
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- The structure of plane graphs with independent crossings and its applications to coloring problems
- \((\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 outer-1-planar graphs: the cold case
- Total coloring of recursive maximal planar graphs
- The total coloring of \(K_5\)-minor-free graphs
- Total coloring of claw-free planar graphs
- A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
- Total-coloring of sparse graphs with maximum degree 6
- Total coloring of planar graphs without some chordal 6-cycles
- On total colorings of 1-planar graphs
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- On total chromatic number of planar graphs without 4-cycles
- On total colorings of some special 1-planar graphs
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
- Total colorings of planar graphs with sparse triangles
- Total colorings of planar graphs without chordal 6-cycles
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- The total chromatic number of regular graphs of even order and high degree
- Minimum total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs without chordal 7-cycles
- Total coloring of planar graphs without short cycles
- A note on the minimum total coloring of planar graphs
- The total chromatic number of some bipartite graphs
- The linear arboricity of planar graphs of maximum degree seven is four
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Total coloring of embedded graphs with maximum degree at least seven
- Total coloring of planar graphs with maximum degree 8
- Total colorings of F₅-free planar graphs with maximum degree 8
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
- On the total choosability of planar graphs and of sparse graphs
- 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
- Randomly colouring graphs (a combinatorial view)
- Acyclic total colorings of planar graphs without \(l\) cycles
- Minimum total coloring of planar graph
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Total coloring of planar graphs without chordal short cycles
- scientific article; zbMATH DE number 6311321 (Why is no real title available?)
- Total coloring of planar graphs without adjacent short cycles
- scientific article; zbMATH DE number 2230302 (Why is no real title available?)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
- Total coloring of planar graphs without some adjacent cycles
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- Total colorings-a survey
- Total coloring of planar graphs without 6-cycles
- Total choosability of planar graphs with maximum degree 4
- 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
- Entire colouring of plane graphs
- On (p,1)-total labelling of 1-planar graphs
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- A larger family of planar graphs that satisfy the total coloring conjecture
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- \([r,s,t]\)-colorings of graphs
- \([r,s,t]\)-chromatic numbers and hereditary properties of graphs
- Facial entire colouring of plane graphs
- Total colorings of planar graphs without small cycles
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Total colorings of planar graphs without adjacent triangles
This page was built for publication: On total 9-coloring planar graphs of maximum degree seven
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242734)
