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
Discussion
View source
View history
Purge
English
Log in

Proper connection number of bipartite graphs

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

DOI10.21136/CMJ.2018.0122-16zbMath1488.05213MaRDI QIDQ4568221

Meiqin Wei, Yan Zhao, Jun Yue

Publication date: 15 June 2018

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)


zbMATH Keywords

bipartite graphdominating setproper coloringproper connection number


Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)





Cites Work

  • Unnamed Item
  • Unnamed Item
  • Proper connection of graphs
  • Proper connection number and connected dominating sets
  • Rainbow connections of graphs: a survey




This page was built for publication: Proper connection number of bipartite graphs

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