Modulo orientations and matchings in graphs

DOI10.1016/J.DISC.2022.112877MaRDI QIDQ2138971zbMATH OpenOpenAlexFDO

Authors Miaomiao Han, Hong-Jian Lai, 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

zbMATH Keywords

matching numberinteger flowmodulo orientationstrongly \(\mathbb{Z}_{2 t + 1} \)-connected

Mathematics Subject Classification ID

Flows in graphs (05C21) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Modulo orientations with bounded independence number
• \(\mod(2p+1)\)-orientations in line graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Mod \((2p+1)\)-orientation on bipartite graphs and complementary graphs
• Counterexamples to Jaeger's circular flow conjecture

Cites work

• scientific article; zbMATH DE number 3904637 (Why is no real title available?)
• scientific article; zbMATH DE number 4187837 (Why is no real title available?)
• A Complexity Dichotomy for the Coloring of Sparse Graphs
• A Contribution to the Theory of Chromatic Polynomials
• Chvátal-Erdös type theorems
• Contractibility and NP-completeness
• Contractions of Planar Graphs in Polynomial Time
• Counterexamples to Jaeger's circular flow conjecture
• Graph minors. XIII: The disjoint paths problem
• Graph theory
• Grötzsch's theorem on 3-colorings
• Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
• Nowhere-zero 3-flow of graphs with small independence number
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
• On the Imbedding of Linear Graphs in Surfaces
• On the complexity of \(H\)-colouring planar graphs
• On the degrees of the vertices of a directed graph
• Ore Condition and Nowhere-Zero 3-Flows
• Superposition and constructions of graphs without nowhere-zero k-flows
• The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(9)

• The orientation of modules based on graph decomposition
• Weighted modulo orientations of graphs and signed graphs
• Modulo 5-orientations and degree sequences
• On mod \((2p+1)\)-orientations of graphs
• On Mod $(2s+1)$-Orientations of Graphs
• Modulo orientations with bounded independence number
• \(\mod(2p+1)\)-orientations in line graphs
• Mod \((2p+1)\)-orientation on bipartite graphs and complementary graphs
• On weighted modulo orientation of graphs

This page was built for publication: Modulo orientations and matchings in graphs

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