Neighbor product distinguishing total coloring of planar graphs without 5-cycles
From MaRDI portal
Publication:6661065
Recommendations
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor product distinguishing total colorings
Cites work
- scientific article; zbMATH DE number 7144820 (Why is no real title available?)
- A note on the neighbor sum distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- Adjacent vertex distinguishing total colorings of 2-degenerate graphs
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Combinatorial Nullstellensatz
- Graph theory with applications
- Neighbor product distinguishing total colorings
- Neighbor product distinguishing total colorings of 2-degenerate graphs
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Neighbor sum distinguishing total choosability of graphs with larger maximum average degree.
- Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sums distinguishing total colorings of planar graphs without short cycles
- On adjacent-vertex-distinguishing total coloring of graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- On the total-neighbor-distinguishing index by sums
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
This page was built for publication: Neighbor product distinguishing total coloring 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 Q6661065)
