Extremal bipartite graphs with a unique k-factor

DOI10.7151/DMGT.1311MaRDI QIDQ3508835zbMATH OpenOpenAlexFDO

Authors Arne Hoffmann, Elżbieta Sidorowicz, Lutz Volkmann

Publication date 1 July 2008

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

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

zbMATH Keywords

bipartite graphsextremal graphsunique \(k\)-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
• Structural remarks on bipartite graphs with unique \(f\)-factors
• Maximum graphs with a unique k-factor
• On the structure of graphs with a unique \(k\)-factor
• The maximum size of graphs with a unique \(k\)-factor

Cited in

(5)

• Structural remarks on bipartite graphs with unique \(f\)-factors
• On graphs with a unique perfect matching
• scientific article; zbMATH DE number 6263605 (Why is no real title available?)
• On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
• Minimum degree of bipartite graphs and the existence of k-factors

This page was built for publication: Extremal bipartite graphs with a unique k-factor

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