The maximum size of graphs with a unique \(k\)-factor
From MaRDI portal
Publication:705753
DOI10.1007/s00493-004-0032-9zbMath1058.05042OpenAlexW2018367070MaRDI QIDQ705753
Publication date: 14 February 2005
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-004-0032-9
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (5)
Sizes and transmissions of digraphs with a given clique number ⋮ On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory ⋮ On unique \(k\)-factors and unique \([1,k\)-factors in graphs.] ⋮ On graphs with a unique perfect matching ⋮ Structural remarks on bipartite graphs with unique \(f\)-factors
This page was built for publication: The maximum size of graphs with a unique \(k\)-factor
