Total colorings and list total colorings of planar graphs without intersecting 4-cycles
From MaRDI portal
(Redirected from Publication:1045095)
Recommendations
- Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- List edge and list total colorings of planar graphs without short cycles
- A note on total colorings of planar graphs without 4-cycles
Cites work
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- A note on total colorings of planar graphs without 4-cycles
- Choosability, edge choosability and total choosability of outerplane graphs
- Determining the total colouring number is NP-hard
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- Graph theory
- List Total Colourings of Graphs
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colourings of multigraphs
- On Total Chromatic Number of a Graph
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Some upper bounds on the total and list chromatic numbers of multigraphs
- The Hall number, the Hall index, and the total Hall number of a graph
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total chromatic number of planar graphs with maximum degree ten
- Total colorings of planar graphs with large maximum degree
- Total colorings of planar graphs without adjacent triangles
- Total colorings of planar graphs without small cycles
- Total colourings of planar graphs with large girth
Cited in
(34)- List edge and list total coloring of planar graphs without intersecting 8-cycles
- List total coloring of pseudo-outerplanar graphs
- Edge choosablity and total choosability of toroidal graphs without intersecting triangles.
- Total coloring of planar graphs without adjacent short cycles
- A note on the minimum number of choosability of planar graphs
- On the total choosability of planar graphs and of sparse graphs
- Minimum total coloring of planar graph
- Total coloring of planar graphs without chordal 7-cycles
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Total coloring of planar graphs with maximum degree 8
- ( + 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
- Total colorings of planar graphs without intersecting 5-cycles
- Total coloring of planar graphs without chordal short cycles
- Total coloring of planar graphs without short cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Optimal channel assignment with list-edge coloring
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
- Minimum choosability of planar graphs
- Total tessellation cover: bounds, hardness, and applications
- Two Chromatic Conjectures: One for Vertices and One for Edges
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- List edge and list total coloring of planar graphs with maximum degree 8
- Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- A note on list edge and list total coloring of planar graphs without adjacent short cycles
- List edge colorings of planar graphs without adjacent 7-cycles
- Total colorings of planar graphs without chordal 6-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 without adjacent chordal 6-cycles
- A structural theorem for planar graphs with some applications
This page was built for publication: Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045095)
