On the Total Coloring of Graphs Embeddable in Surfaces
From MaRDI portal
Publication:4487488
DOI10.1112/S0024610799007668zbMATH Open0945.05025OpenAlexW2038434159MaRDI QIDQ4487488FDOQ4487488
Authors: Yue Zhao 
Publication date: 22 June 2000
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0024610799007668
Recommendations
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- 3-Coloring graphs embedded in surfaces
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Coloring edges of graphs embedded in a surface of characteristic zero.
- Edge colorings of graphs embeddable in a surface of low genus
- Embeddings of a graph into a surface with different weak chromatic numbers
- On acyclic colorings of graphs on surfaces
- Linear coloring of graphs embeddable in a surface of nonnegative characteristic
- Colouring graphs on surfaces
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Relations of low-dimensional topology with graph theory (57M15)
Cited In (17)
- Total coloring of embedded graphs with maximum degree at least seven
- List \((d,1)\)-total labelling of graphs embedded in surfaces
- Coloring parameters for graphs on surfaces
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Total coloring of planar graphs with maximum degree 8
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Three-coloring graphs embedded on surfaces with all faces even-sided
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Edge colorings of graphs embeddable in a surface of low genus
- The entire chromatic number of graphs embedded on the torus with large maximum degree
- Entire coloring of graphs embedded in a surface of nonnegative characteristic
- Total coloring of embedded graphs of maximum degree at least ten
- Title not available (Why is that?)
- Coloring locally bipartite graphs on surfaces.
- A note on defective colorings of graphs in surfaces
- Acyclic \(k\)-strong coloring of maps on surfaces
- Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
This page was built for publication: On the Total Coloring of Graphs Embeddable in Surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487488)
