A characterization for graphs having strong parity factors

DOI10.1007/S00373-021-02293-XMaRDI QIDQ2045389zbMATH OpenOpenAlexFDO

Authors Hongliang Lu, Xuechun Zhang, Z. Yang

Publication date 12 August 2021

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

Full work available at URL https://arxiv.org/abs/2009.12802

zbMATH Keywords

\((g, f)\)-parity factorparity factorstrong parity factor

Mathematics Subject Classification ID

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

Abstract: A graph $G$ has the emph{strong parity property} if for every subset $XsubseteqV$ with $|X|$ even, $G$ has a spanning subgraph $F$ with minimum degree at least one such that $d_F(v)equiv1pmod2$ for all $vinX$, $d_F(y)equiv0pmod2$ for all $yinV(G)-X$. Bujt'as, Jendrol and Tuza (On specific factors in graphs, emph{Graphs and Combin.}, 36 (2020), 1391-1399.) introduced the concept and conjectured that every 2-edge-connected graph with minimum degree at least three has the strong parity property. In this paper, we give a characterization for graphs to have the strong parity property and construct a counterexample to disprove the conjecture proposed by Bujt'as, Jendrol and Tuza.

Recommendations

• Strong parity vertex coloring of plane graphs
• On edge connectivity and parity factor
• Parity and strong parity edge-colorings of graphs
• A degree condition for a graph to have \((a,b)\)-parity factors
• Quasi-parity and perfect graphs

Cites work

• A Tutte-type characterization for graph factors
• Characterization of 1-tough graphs using factors
• Graph Factors and Matching Extensions
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• On factors with all degrees odd
• On specific factors in graphs
• Some results on odd factors of graphs
• The factorization of graphs. II

Cited in

(10)

• Equitable factorizations of edge-connected graphs
• scientific article; zbMATH DE number 1998304 (Why is no real title available?)
• Sufficient conditions for graphs to have strong parity factors
• Perfect integer k-matching, k-factor-critical, and the spectral radius of graphs
• A spectral condition for a graph to have strong parity factors
• Some results on the k-strong parity property in a graph
• Spectral conditions for a graph to have strong parity factors
• Odd-even factors of graphs
• Laplacian eigenvalue condition for a graph to have the strong parity property
• A characterization of graphs without even factors

This page was built for publication: A characterization for graphs having strong parity factors

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