Adjacent vertex distinguishing total coloring of graphs with maximum degree 4

DOI10.1016/J.DISC.2016.07.011zbMATH Open1351.05084OpenAlexW2516479019MaRDI QIDQ2374166FDOQ2374166

Rong Luo, Jiaao Li, You Lu, Zhengke Miao

Publication date: 14 December 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.07.011

Recommendations

• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• On the AVDTC of 4-regular graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)

zbMATH Keywords

maximum degreecombinatorial Nullstellensatzadjacent vertex-distinguishing total coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• Adjacent strong edge coloring of graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Concise proofs for adjacent vertex-distinguishing total colorings
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Combinatorial Nullstellensatz
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the vertex-distinguishing proper edge-colorings of graphs
• Balanced edge colorings.
• Vertex‐distinguishing edge colorings of random graphs
• Vertex-distinguishing edge colorings of graphs
• Title not available (Why is that?)
• On the AVDTC of 4-regular graphs

Cited In (20)

• 2-distance vertex-distinguishing total coloring of graphs
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• On the AVDTC of Sierpiński-type graphs
• Adjacent vertex distinguishing total coloring in split graphs
• Strict neighbor-distinguishing total index of graphs
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
• Weight choosability of graphs with maximum degree 4
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Inclusion total chromatic number
• Title not available (Why is that?)
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
• Neighbor product distinguishing total colorings of 2-degenerate graphs
• List neighbor sum distinguishing edge coloring of subcubic graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)

This page was built for publication: Adjacent vertex distinguishing total coloring of graphs with maximum degree 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374166)