Elementary graphs with respect to \(f\)-parity factors

DOI10.1007/s00373-010-0878-0zbMath1205.05180OpenAlexW2074123663MaRDI QIDQ968209

Jácint Szabó, Gyula Y. Katona, Mikio Kano

Publication date: 5 May 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0878-0

zbMATH Keywords

\((1,f)\)-odd factorstructure theoremelementary graphodd factor\(f\)-parity factorparity factor

Mathematics Subject Classification ID

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

Related Items (4)

Spanning trees and spanning closed walks with small degrees ⋮ An Extension of Cui-Kano's Characterization on Graph Factors ⋮ Toughness and spanning trees in K4‐minor‐free graphs ⋮ On Cui-Kano's Characterization Problem on Graph Factors

Cites Work

• Unnamed Item
• Structure theorem and algorithm on \((1,f)\)-odd subgraph
• On factors with all degrees odd
• General factors of graphs
• Odd subgraphs and matchings
• Some results on odd factors of graphs
• Paths, Trees, and Flowers
• The factorization of graphs. II
• On the structure of factorizable graphs

This page was built for publication: Elementary graphs with respect to \(f\)-parity factors