On f-factors of a graph

DOI10.1016/0016-0032(85)90027-4MaRDI QIDQ1820798zbMATH OpenOpenAlexFDO

Authors Jialong Lan, Wai-Kai Chen

Publication date 1985

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(85)90027-4

zbMATH Keywords

degree sequencesf-factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

This paper probes the relations between f-factors and subgraphs and their degree sequences in a graph when the graph has the odd-cycle property and contains no self-loop. Useful results are derived which greatly simplify tests of the existence of f-factors.

Recommendations

• scientific article; zbMATH DE number 3853126
• scientific article; zbMATH DE number 3855160
• Sufficient conditions for a graph to have factors
• Some conditions for the existence off-factors
• An algorithmic proof of Tutte's f-factor theorem

Cites work

• scientific article; zbMATH DE number 3508526 (Why is no real title available?)
• On Factors of a Graph
• Some Properties of Graphs with Multiple Edges
• Spanning subgraphs with specified valencies
• Subgraphs and their degree sequences of a digraph
• The Factors of Graphs

Cited in

(7)

• A note on f-factors in directed and undirected multigraphs
• On caterpillar factors in graphs
• scientific article; zbMATH DE number 3853126 (Why is no real title available?)
• scientific article; zbMATH DE number 3855160 (Why is no real title available?)
• Some conditions for the existence off-factors
• An algorithmic proof of Tutte's f-factor theorem
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: On f-factors of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820798)