Elementary graphs with respect to f-parity factors

DOI10.1007/S00373-010-0878-0zbMATH Open1205.05180OpenAlexW2074123663MaRDI QIDQ968209FDOQ968209

Authors: Gyula Y. Katona, Jácint Szabó, 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

Recommendations

• Publication:4862225
• Note on parity factors of regular graphs
• scientific article; zbMATH DE number 1283862
• scientific article; zbMATH DE number 822172
• scientific article; zbMATH DE number 562235
• scientific article; zbMATH DE number 5137395
• On some factor theorems of graphs
• Even [a,b]-factors in graphs
• On \((g,f)\)-factorizations of graphs
• scientific article; zbMATH DE number 700639

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• An Extension of Cui-Kano's Characterization on Graph Factors
• Spanning trees and spanning closed walks with small degrees
• Structure theorem and algorithm on \((1,f)\)-odd subgraph
• Toughness and spanning trees in K4‐minor‐free graphs
• On Cui-Kano's characterization problem on graph factors

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

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