Maximum graphs with a unique k-factor

DOI10.1016/0095-8956(84)90044-3zbMATH Open0535.05036OpenAlexW2025895778MaRDI QIDQ790832FDOQ790832

Authors: George R. T. Hendry 

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90044-3

Recommendations

• The maximum size of graphs with a unique \(k\)-factor
• Publication:5750893
• On the structure of graphs with a unique \(k\)-factor
• On the structure of graphs with a uniquek-factor
• Extremal properties of \((1,f)\)-odd factors in graphs.

zbMATH Keywords

factorsTuran-problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the 1-factors of a non-separable graph
• On the structure of factorizable graphs
• Graphs with exactly one hamiltonian circuit
• A census of maximum uniquely hamiltonian graphs

Cited In (11)

• The maximum size of graphs with a unique \(k\)-factor
• On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
• Extremal bipartite graphs with a unique k-factor
• On the structure of graphs with a uniquek-factor
• Title not available (Why is that?)
• Title not available (Why is that?)
• On graphs with a unique perfect matching
• Graph factors and factorization: 1985--2003: a survey
• On the structure of graphs with a unique \(k\)-factor
• On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
• Spectral radius and \([a,b]\)-factors in graphs

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)