Concise proofs for adjacent vertex-distinguishing total colorings
From MaRDI portal
Publication:1025519
DOI10.1016/j.disc.2008.06.002zbMath1221.05143OpenAlexW2009043562MaRDI QIDQ1025519
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.06.002
Related Items (27)
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Strict neighbor-distinguishing total index of graphs ⋮ Adjacent vertex distinguishing total colorings of 2-degenerate graphs ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ Upper bounds on adjacent vertex distinguishing total chromatic number of graphs ⋮ Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable ⋮ The adjacent vertex distinguishing total chromatic number ⋮ Unnamed Item ⋮ The adjacent vertex distinguishing total coloring of planar graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Vertex coloring of graphs by total 2-weightings ⋮ Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ A note on decycling number, vertex partition and AVD-total coloring in graphs ⋮ A note on the adjacent vertex distinguishing total chromatic number of graphs ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Inclusion total chromatic number ⋮ On the total and AVD-total coloring of graphs ⋮ Neighbor product distinguishing total colorings of 2-degenerate graphs ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ General vertex-distinguishing total coloring of graphs ⋮ AVD-total-colouring of complete equipartite graphs ⋮ On the total-neighbor-distinguishing index by sums ⋮ \(d\)-strong total colorings of graphs
Cites Work
- On the vertex-distinguishing proper edge-colorings of graphs
- Adjacent strong edge coloring of graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On adjacent-vertex-distinguishing total coloring of graphs
- Vertex-distinguishing proper edge-colorings
This page was built for publication: Concise proofs for adjacent vertex-distinguishing total colorings
