Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Vertex-distinguishing IE-total colorings of complete bipartite graphs K_{m,n}(m<n)

From MaRDI portal
Publication:2860859
Jump to:navigation, search

DOI10.7151/DMGT.1659zbMath1305.05071OpenAlexW1991467663MaRDI QIDQ2860859

Bing Yao, Xiang'en Chen, Yu-ping Gao

Publication date: 11 November 2013

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1659


zbMATH Keywords

complete bipartite graphsIE-total coloringvertex-distinguishing IE-total chromatic numbervertex-distinguishing IE-total coloring


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)








This page was built for publication: Vertex-distinguishing IE-total colorings of complete bipartite graphs K_{m,n}(m<n)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2860859&oldid=15793860"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki