Maximum graphs with a unique k-factor
From MaRDI portal
Publication:790832
Recommendations
Cites work
Cited in
(11)- Graph factors and factorization: 1985--2003: a survey
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
- On the structure of graphs with a unique \(k\)-factor
- scientific article; zbMATH DE number 4185653 (Why is no real title available?)
- The maximum size of graphs with a unique \(k\)-factor
- Spectral radius and \([a,b]\)-factors in graphs
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
- On the structure of graphs with a uniquek-factor
- Extremal bipartite graphs with a unique k-factor
- On graphs with a unique perfect matching
- scientific article; zbMATH DE number 4101257 (Why is no real title available?)
This page was built for publication: Maximum 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 Q790832)