Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
From MaRDI portal
Publication:2282476
DOI10.7151/DMGT.2122zbMath1430.05044OpenAlexW2810616411WikidataQ129587078 ScholiaQ129587078MaRDI QIDQ2282476
Publication date: 8 January 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2122
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
- Neighbor sum distinguishing total choosability of planar graphs
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Neighbor sum distinguishing total colorings of planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- On the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- On the total-neighbor-distinguishing index by sums
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
- Neighbor sum distinguishing total coloring of 2-degenerate graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
This page was built for publication: Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
