Connected odd factors of graphs

MaRDI QIDQ5377021zbMATH OpenFDO

Authors Nastaran Haghparast, Shun-ichi Maezawa, Kenta Ozeki, Mikio Kano

Publication date 23 May 2019

Full work available at URL http://ajc.maths.uq.edu.au/pdf/73/ajc_v73_p200.pdf

zbMATH Keywords

4-edge-connected graph

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Connected \([k,k+1]\)-factors of graphs
• On factors with all degrees odd
• On edge connectivity and parity factor
• Odd factors of a graph
• Some results on odd factors of graphs

Cites work

• A reduction method to find spanning Eulerian subgraphs
• Connected factors in graphs -- a survey
• Edge-connectivity and edge-disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Flows and generalized coloring theorems in graphs
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• On factors with all degrees odd
• On the Problem of Decomposing a Graph into n Connected Factors
• Supereulerian graphs: A survey

Cited in

(1)

• Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors

This page was built for publication: Connected odd factors of graphs

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