Modulo orientations and matchings in graphs
From MaRDI portal
Publication:2138971
DOI10.1016/j.disc.2022.112877zbMath1489.05118OpenAlexW4220849758MaRDI QIDQ2138971
Hong-Jian Lai, Miaomiao Han, Jian-Bing Liu
Publication date: 17 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112877
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Flows in graphs (05C21)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
- The weak 3-flow conjecture and the weak circular flow conjecture
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- On the complexity of \(H\)-colouring planar graphs
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- Counterexamples to Jaeger's circular flow conjecture
- Graph minors. XIII: The disjoint paths problem
- Nowhere-zero 3-flow of graphs with small independence number
- On the degrees of the vertices of a directed graph
- Grötzsch's theorem on 3-colorings
- Chvátal-Erdös type theorems
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
- Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
- Contractions of Planar Graphs in Polynomial Time
- Ore Condition and Nowhere-Zero 3-Flows
- Contractibility and NP-completeness
- A Complexity Dichotomy for the Coloring of Sparse Graphs
- On the Imbedding of Linear Graphs in Surfaces
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: Modulo orientations and matchings in graphs