Neighbor product distinguishing total coloring of planar graphs without 5-cycles
From MaRDI portal
Publication:6661065
DOI10.1007/s10114-024-2622-3MaRDI QIDQ6661065
Publication date: 10 January 2025
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor product distinguishing total colorings
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- On the neighbor sum distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Neighbor product distinguishing total colorings of 2-degenerate graphs
- On the total-neighbor-distinguishing index by sums
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- On adjacent-vertex-distinguishing total coloring of graphs
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Combinatorial Nullstellensatz
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
This page was built for publication: Neighbor product distinguishing total coloring of planar graphs without 5-cycles
