The adjacent vertex distinguishing total chromatic numbers of planar graphs with =10
From MaRDI portal
Publication:2410091
Recommendations
- The adjacent vertex distinguishing total coloring of planar graphs
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
Cites work
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Adjacent vertex distinguishing total colorings of outerplanar graphs
- Combinatorial Nullstellensatz
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Graph theory with applications
- 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 maximum degree \(\varDelta\)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- On adjacent-vertex-distinguishing total coloring of graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On the total-neighbor-distinguishing index by sums
- Planar graphs of maximum degree seven are Class I
- The adjacent vertex distinguishing total chromatic number
- The adjacent vertex distinguishing total coloring of planar graphs
Cited in
(19)- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- A characterization for the neighbor-distinguishing total chromatic number of planar graphs with = 13
- Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
- Neighbor sum distinguishing total colorings of corona of subcubic graphs
- Adjacent vertex distinguishing total coloring in split graphs
- On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)
- Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
- Neighbor sum distinguishing total chromatic number of planar graphs
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
- The adjacent vertex distinguishing total coloring of planar graphs
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Neighbor product distinguishing total coloring of planar graphs without 5-cycles
- Neighbor product distinguishing total coloring via combinatorial Nullstellensatz
- Adjacent vertex distinguishing total coloring of the corona product of graphs
- Adjacent vertex distinguishing total coloring of corona product of graphs
- Neighbor product distinguishing total colorings of corona of subcubic graphs
- Total-neighbor-distinguishing coloring by sums of fractals of generalized Sierpiński graphs
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
This page was built for publication: The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2410091)
