Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
From MaRDI portal
(Redirected from Publication:476647)
Recommendations
- On the Total Coloring of Graphs Embeddable in Surfaces
- Total coloring of embedded graphs of maximum degree at least ten
- Total coloring of embedded graphs with maximum degree at least seven
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.
Cites work
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- A note on the total coloring of planar graphs without adjacent 4-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On Total Chromatic Number of a Graph
- On maximal injective subalgebras in a \(w\Gamma\) factor
- 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
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- 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 coloring of planar graphs without 6-cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(14)- Total coloring of embedded graphs with maximum degree at least seven
- List \((d,1)\)-total labelling of graphs embedded in surfaces
- On the Total Coloring of Graphs Embeddable in Surfaces
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Total coloring of planar graphs without chordal short cycles
- Total colorings-a survey
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- The total coloring of \(K_5\)-minor-free graphs
- Edge colorings of graphs embeddable in a surface of low genus
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.
- Total coloring of embedded graphs of maximum degree at least ten
- Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
This page was built for publication: Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476647)
