scientific article; zbMATH DE number 7448540

DOI10.16163/J.CNKI.22-1123/N.2021.02.004zbMATH Open1488.05211MaRDI QIDQ5017147FDOQ5017147

Lan Yang, Xiang'en Chen

Publication date: 17 December 2021

Title of this publication is not available (Why is that?)

Recommendations

• The vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{8, n}}\) \((n \ge 7770)\)
• Vertex-distinguishing E-total coloring of complete bipartite graph \({K_{8,n}}\) with \({472 \le n \le 980}\)
• Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{3,n}\) with \(n\geq 18\)
• Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(96\leq n\leq 472\).
• Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(7 \leq n \leq 95\)
• Vertex-distinguishing E-total coloring of complete bipartite graph \(K_{7,n}\) when \(473\leq n<977\).
• 完全二部图K3,n（3≤n≤17）的点可区别E-全染色
• Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{8,n}\)
• Vertex-distinguishing E-total coloring of a complete bipartite graph \({K_{9,n}}\) \((93 \le n \le 216)\)
• scientific article

zbMATH Keywords

complete bipartite graphE-total coloringvertex-distinguishing E-total chromatic numbervertex-distinguishing E-total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• 完全二部图 K 10, n (215 ≤ n ≤ 466)的点可区别E-全染色
• Title not available (Why is that?)
• 完全二部图K3,n（3≤n≤17）的点可区别E-全染色
• Title not available (Why is that?)

This page was built for publication:

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