Total coloring of embedded graphs of maximum degree at least ten
From MaRDI portal
(Redirected from Publication:625795)
Recommendations
- Total coloring of embedded graphs with maximum degree at least seven
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- On the Total Coloring of Graphs Embeddable in Surfaces
- Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
Cites work
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- A note on total colorings of planar graphs without 4-cycles
- Determining the total colouring number is NP-hard
- List edge and list total colorings of planar graphs without 4-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On Total Chromatic Number of a Graph
- On the Total Coloring of Graphs Embeddable in Surfaces
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total coloring of a multigraph with maximal degree 4
- 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 small cycles
- Total colourings of graphs
- Total colourings of planar graphs with large girth
Cited in
(10)- The total coloring of \(K_5\)-minor-free graphs
- Total colorings-a survey
- Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.
- Total coloring of embedded graphs with maximum degree at least seven
- Reconfiguring 10-colourings of planar graphs
- On graph proper total colorings with labelling-type restrictions
- The entire chromatic number of graphs embedded on the torus with large maximum degree
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
This page was built for publication: Total coloring of embedded graphs of maximum degree at least ten
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625795)