Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10

DOI10.1007/s10878-018-00375-wzbMath1420.05052OpenAlexW3151155221WikidataQ128686687 ScholiaQ128686687MaRDI QIDQ2424800

Qiancheng Ouyang, Yu-Lin Chang, Guang-Hui Wang

Publication date: 25 June 2019

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

Full work available at URL: https://doi.org/10.1007/s10878-018-00375-w

zbMATH Keywords

planar graphcombinatorial Nullstellensatzadjacent vertex distinguishing total coloringdischarging

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (1)

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8

Cites Work

• Unnamed Item
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Neighbor sum distinguishing total choosability of planar graphs
• The adjacent vertex distinguishing total chromatic number
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• On the AVDTC of 4-regular graphs
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• On the total coloring of certain graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• On total 9-coloring planar graphs of maximum degree seven
• Combinatorial Nullstellensatz
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• On Total Chromatic Number of a Graph
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz

This page was built for publication: Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10