The Lower Bipartite Number of a Graph

DOI10.1556/314.2023.00003MaRDI QIDQ6097410zbMATH OpenOpenAlexFDO

Authors Anna Bachstein, Wayne Goddard

Publication date 5 June 2023

Published in Mathematica Pannonica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1556/314.2023.00003

zbMATH Keywords

bipartitegraphdominationindependent

Mathematics Subject Classification ID

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

Recommendations

• Bipartite Domination in Graphs
• Upper bounds on minimum balanced bipartitions
• On lower bounds for the \(b\)-chromatic number of connected bipartite graphs
• On the characterization of the maximal connected bipartite graphs with given domination number
• A new lower bound for the bipartite crossing number with applications

This page was built for publication: The Lower Bipartite Number of a Graph

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