General vertex-distinguishing total coloring of complete bipartite graphs.

zbMATH Open1413.05128MaRDI QIDQ2828966

Hong Yang

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

complete bipartite graphcolor-setgeneral vertex-distinguishing total chromatic numbergeneral vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Title not available (Why is that?) ⋮ Title not available (Why is that?)

Recommendations

• General vertex-distinguishing total coloring of graphs 👍 👎
• Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\)) 👍 👎
• 完全二部图K_(2,n)和K_(3,n)的一般点可区别全染色 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: General vertex-distinguishing total coloring of complete bipartite graphs.

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