Some counterexamples to D(d)-VDTC conjecture

DOI10.13413/J.CNKI.JDXBLXB.2016.01.12MaRDI QIDQ2990537zbMATH OpenFDO

Authors Xiang'en Chen, Yuping He

Publication date 10 August 2016

zbMATH Keywords

cycletotal coloringcirculant graphvertex distinguishing total chromatic numbervertex distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Vertex-distinguishing total coloring of \(m C_8\)
• Vertex-distinguishing total coloring of graphs
• Vertex-distinguishing total colorings of \(mK_4\)
• Vertex-distinguishing total coloring of \(m{C_6}\)
• Counterexamples to the strong \(d\)-step conjecture for \(d\geq 5\)

Cited in

(1)

• Examples around the strong Viterbo conjecture

This page was built for publication: Some counterexamples to \(D(d)\)-VDTC conjecture

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