On the structure of graphs with a uniquek-factor

DOI<227::AID-JGT1>3.0.CO;2-D 10.1002/1097-0118(200012)35:4<227::AID-JGT1>3.0.CO;2-DzbMath0965.05080OpenAlexW4243090019MaRDI QIDQ4521492

Petra Johann

Publication date: 2 August 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200012)35:4<227::aid-jgt1>3.0.co;2-d

zbMATH Keywords

extremal 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)

Related Items

Spectral radius and \([a,b\)-factors in graphs], Graph factors and factorization: 1985--2003: a survey, 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

Cites Work

• Maximum graphs with a unique k-factor
• A note concerning graphs with unique f-factors
• A census of maximum uniquely hamiltonian graphs
• Graphs with exactly one hamiltonian circuit
• On the structure of factorizable graphs