The splitting number of complete bipartite graphs
From MaRDI portal
Publication:793047
DOI10.1007/BF01772941zbMATH Open0538.05031MaRDI QIDQ793047FDOQ793047
Authors: Brad Jackson, Gerhard Ringel
Publication date: 1984
Published in: Archiv der Mathematik (Search for Journal in Brave)
Recommendations
- The splitting number of the complete graph
- The bipartite-splittance of a bipartite graph
- The splitting number of the complete graph in the projective plane
- On the bipartition of graphs
- scientific article; zbMATH DE number 426164
- The extremal number of the subdivisions of the complete bipartite graph
- scientific article; zbMATH DE number 4193736
- On the decomposition of graphs into complete bipartite graphs
- Split graphs: combinatorial species and asymptotics
- On biclique partitions of the complete graph
Cites Work
Cited In (11)
- SPLITTING NUMBER is NP-complete
- Planarizing graphs and their drawings by vertex splitting
- The splitting number of the complete graph
- On the equivalence covering number of splitgraphs
- Title not available (Why is that?)
- Splitting plane graphs to outerplanarity
- Pagenumber of complete bipartite graphs
- Splitting plane graphs to outerplanarity
- On the planar split thickness of graphs
- The splitting number of the complete graph in the projective plane
- The toroidal splitting number of the complete graph \(K_ n\)
This page was built for publication: The splitting number of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793047)