Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve

DOI10.1007/S10878-019-00465-3MaRDI QIDQ2292141zbMATH OpenOpenAlexWikidataFDO

Authors Jingjing Huo, Wenjing Xia, Yiqiao Wang, Weifan Wang

Publication date 3 February 2020

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

Full work available at URL https://doi.org/10.1007/s10878-019-00465-3

zbMATH Keywords

planar graphcombinatorial nullstellensatzdischargingneighbor-distinguishing total coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with = 13
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)

Cites work

• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with = 13
• A note 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 graphs with maximum degree 4
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• Combinatorial Nullstellensatz
• Concise proofs for adjacent vertex-distinguishing total colorings
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• 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\)
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• The adjacent vertex distinguishing total chromatic number
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• The adjacent vertex distinguishing total coloring of planar graphs

Cited in

(3)

• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with = 13

This page was built for publication: Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve

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