The maximum size of graphs with a unique k-factor
From MaRDI portal
Publication:705753
DOI10.1007/S00493-004-0032-9zbMATH Open1058.05042OpenAlexW2018367070MaRDI QIDQ705753FDOQ705753
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)
Cited In (7)
- Title not available (Why is that?)
- Sizes and transmissions of digraphs with a given clique number
- Structural remarks on bipartite graphs with unique \(f\)-factors
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
- On the structure of graphs with a uniquek-factor
- On graphs with a unique perfect matching
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
This page was built for publication: The maximum size of 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 Q705753)
