Adjacent vertex distinguishing total coloring of graphs with maximum degree 4

DOI10.1016/J.DISC.2016.07.011MaRDI QIDQ2374166zbMATH OpenOpenAlexFDO

Authors You Lu, Jiaao Li, Rong Luo, 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

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)

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

Cites work

• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• Adjacent strong edge coloring of graphs
• Balanced edge colorings.
• Combinatorial Nullstellensatz
• Concise proofs for adjacent vertex-distinguishing total colorings
• Graph theory
• On adjacent-vertex-distinguishing total coloring of graphs
• On the AVDTC of 4-regular 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 vertex-distinguishing proper edge-colorings of graphs
• Vertex-distinguishing edge colorings of graphs
• Vertex-distinguishing proper edge-colorings
• Vertex‐distinguishing edge colorings of random graphs

Cited in

(24)

• 2-distance vertex-distinguishing total coloring of graphs
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Adjacent vertex distinguishing total coloring in split graphs
• On the AVDTC of Sierpiński-type graphs
• On the AVDTC of 4-regular graphs
• Strict neighbor-distinguishing total index of graphs
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
• A note on decycling number, vertex partition and AVD-total coloring in graphs
• AVD-total-colouring of complete equipartite 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
• scientific article; zbMATH DE number 6423760 (Why is no real title available?)
• 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
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
• List neighbor sum distinguishing edge coloring of subcubic graphs
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
• 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 = 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)