A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
From MaRDI portal
Publication:1783617
DOI10.1016/j.disc.2018.07.011zbMath1395.05058OpenAlexW2886078157MaRDI QIDQ1783617
Jingjing Huo, Yi Qiao Wang, Wei Fan Wang
Publication date: 21 September 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.07.011
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
Cites Work
- The adjacent vertex distinguishing total chromatic number
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- Concise proofs for adjacent vertex-distinguishing total colorings
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- On the AVDTC of 4-regular graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
- The adjacent vertex distinguishing total coloring of planar graphs
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On adjacent-vertex-distinguishing total coloring of graphs
- Combinatorial Nullstellensatz
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
This page was built for publication: A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
