Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
From MaRDI portal
Publication:2282476
Recommendations
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- scientific article; zbMATH DE number 7478554
- Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
Cites work
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Graph theory with applications
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
- Neighbor sum distinguishing total choosability of planar graphs
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles
- Neighbor sum distinguishing total coloring of 2-degenerate graphs
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of planar graphs
- Neighbor sum distinguishing total colorings of planar graphs with girth at least 5
- 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 colorings via the combinatorial nullstellensatz
- Neighbor sums distinguishing total colorings of planar graphs without short cycles
- On the neighbor sum distinguishing total coloring of planar graphs
- On the total-neighbor-distinguishing index by sums
Cited in
(8)- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sums distinguishing total colorings of planar graphs without short cycles
- Neighbor sum distinguishing total chromatic number of planar graphs without 4-cycles
- scientific article; zbMATH DE number 7478554 (Why is no real title available?)
- Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles
- Neighbor sum distinguishing total coloring of planar graphs with restrained cycles
- Neighbor product distinguishing total coloring of planar graphs without 5-cycles
This page was built for publication: Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282476)
