On degree sets and the minimum orders in bipartite graphs
From MaRDI portal
Publication:2450132
DOI10.7151/DMGT.1742zbMATH Open1290.05063OpenAlexW2083211056MaRDI QIDQ2450132FDOQ2450132
Authors: Y. Manoussakis, H. P. Patil
Publication date: 16 May 2014
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1742
Recommendations
Vertex degrees (05C07) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (11)
- Title not available (Why is that?)
- Minimum degree thresholds for bipartite graph tiling
- On the order of a graph with a given degree set
- Title not available (Why is that?)
- Degree sets in bipartite and 3-partite graphs
- On \(k\)-ordered bipartite graphs
- On degree sets in \(k\)-partite graphs
- Bipartite Graphs and their Degree Sets
- Tripartite graphs with given degree set
- Bipartite-assembly
- Exact and approximate results on the least size of a graph with a given degree set
This page was built for publication: On degree sets and the minimum orders in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450132)