The factorization of graphs. II

DOI10.1007/BF01889919zbMATH Open0247.05155OpenAlexW2077574397MaRDI QIDQ5659592FDOQ5659592

László Lovász

Publication date: 1972

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01889919

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites Work

• Paths, Trees, and Flowers
• The 1-Factors of Oriented Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Factors of Graphs
• Subgraphs with prescribed valencies
• Antisymmetrical Digraphs
• On the structure of factorizable graphs

Cited In (49)

• Ryser's theorem for \(\rho\)-Latin rectangles
• An Extension of Cui-Kano's Characterization on Graph Factors
• A degree condition for graphs having all \((a, b)\)-parity factors
• Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
• A degree condition for a graph to have \((a,b)\)-parity factors
• Elementary graphs with respect to \(f\)-parity factors
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
• \(\{0, 2 \}\)-degree free spanning forests in graphs
• Quasi-Eulerian hypergraphs
• The membership problem in jump systems
• On some factor theorems of graphs
• Factors with red-blue coloring of claw-free graphs and cubic graphs
• A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
• Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming
• Editing graphs to satisfy degree constraints: a parameterized approach
• Structure theorem and algorithm on \((1,f)\)-odd subgraph
• Good characterizations for some degree constrained subgraphs
• Equitable factorizations of edge-connected graphs
• Antifactors of regular bipartite graphs
• Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors
• The superstar packing problem
• On the Saxl graph of a permutation group
• On edge connectivity and parity factor
• A characterization of graphs having all \((g,f)\)-factors
• General factors of graphs
• \(\{k,r-k\}\)-factors of \(r\)-regular graphs
• Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
• On Cui-Kano's characterization problem on graph factors
• Tractable cases of the extended global cardinality constraint
• Characterization of 1-tough graphs using factors
• Degree factors with red-blue coloring of regular graphs
• Degree constrained subgraphs
• Optimal general factor problem and jump system intersection
• \([a,b]\)-factors of graphs on surfaces
• Sharp conditions for the existence of an even $[a,b]$-factor in a graph
• Path problems in skew-symmetric graphs
• A characterization for graphs having strong parity factors
• A Tutte-Type Characterization for Graph Factors
• Graph Orientation with Edge Modifications
• Regular colorings in regular graphs
• AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
• Gadget classification
• Factors in graphs with odd-cycle property
• Maximum and optimal 1-2 matching problem of the different kind
• Monadic Second Order Logic on Graphs with Local Cardinality Constraints
• The Simple Reachability Problem in Switch Graphs
• Packing $k$-Matchings and $k$-Critical Graphs
• Title not available (Why is that?)
• Graph editing problems with extended regularity constraints

This page was built for publication: The factorization of graphs. II

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