The adjacent vertex distinguishing total coloring of planar graphs

DOI10.1007/S10878-012-9527-2zbMATH Open1319.90076OpenAlexW1967155492MaRDI QIDQ2444142FDOQ2444142

Authors: Danjun Huang, Weifan Wang 

Publication date: 8 April 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9527-2

Recommendations

• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing total colorings of outer 1-planar graphs
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)

zbMATH Keywords

maximum degreeplanar graphadjacent vertex distinguishing total coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On adjacent-vertex-distinguishing total coloring of graphs
• Every planar map is four colorable
• Concise proofs for adjacent vertex-distinguishing total colorings
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Adjacent vertex distinguishing total coloring of graphs with lower average degree

Cited In (52)

• Title not available (Why is that?)
• Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
• Title not available (Why is that?)
• Title not available (Why is that?)
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Adjacent vertex distinguishing total coloring in split graphs
• General vertex-distinguishing total coloring of graphs
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Adjacent-vertex-distinguishing total coloring of planar bipartite graphs
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Neighbor sum distinguishing total colorings of planar graphs
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
• Neighbor sum distinguishing total choosability of planar graphs
• Strict neighbor-distinguishing total index of graphs
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
• Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing edge coloring of IC-planar graphs
• AVD-total-colouring of complete equipartite graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• On the total and AVD-total coloring of graphs
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• 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 colorings of outer 1-planar graphs
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Title not available (Why is that?)
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Neighbor product distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Neighbor product distinguishing total colorings
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Title not available (Why is that?)
• On the adjacent vertex distinguishing total chromatic number of outer plane graph.
• AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
• Neighbor sum distinguishing total chromatic number of planar graphs
• Distant set distinguishing total colourings of graphs

This page was built for publication: The adjacent vertex distinguishing total coloring of planar graphs

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