On degree sets and the minimum orders in bipartite graphs

DOI10.7151/DMGT.1742MaRDI QIDQ2450132zbMATH OpenOpenAlexFDO

Authors Y. Manoussakis, H. P. Patil

Publication date 16 May 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

unicyclic graphsdegree sets

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bipartite Graphs and their Degree Sets
• Degree sets in bipartite and 3-partite graphs
• Bipartite-assembly
• Further results on degree sets for graphs
• On the order of a graph with a given degree set

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Bipartite Graphs and their Degree Sets
• Degree sets for graphs
• Degree sets in bipartite and 3-partite graphs
• Further results on degree sets for graphs
• On the least size of a graph with a given degree set

Cited in

(11)

• scientific article; zbMATH DE number 6100973 (Why is no real title available?)
• Minimum degree thresholds for bipartite graph tiling
• On the order of a graph with a given degree set
• scientific article; zbMATH DE number 7771746 (Why is no real title available?)
• 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)