On degree sets and the minimum orders in bipartite graphs

DOI10.7151/dmgt.1742zbMath1290.05063OpenAlexW2083211056MaRDI QIDQ2450132

H. P. Patil, Yannis Manoussakis

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

zbMATH Keywords

unicyclic graphsdegree sets

Mathematics Subject Classification ID

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

Related Items (3)

Exact and approximate results on the least size of a graph with a given degree set ⋮ Tripartite graphs with given degree set ⋮ On degree sets in \(k\)-partite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the least size of a graph with a given degree set
• Further results on degree sets for graphs
• Bipartite Graphs and their Degree Sets
• Degree sets for graphs

This page was built for publication: On degree sets and the minimum orders in bipartite graphs