The factorization of graphs. II
From MaRDI portal
Publication:5659592
DOI10.1007/BF01889919zbMath0247.05155OpenAlexW2077574397MaRDI QIDQ5659592
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
Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Graph theory (05C99)
Related Items
Maximum and optimal 1-2 matching problem of the different kind, Gadget classification, General factors of graphs, Equitable factorizations of edge-connected graphs, Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors], The superstar packing problem, An Extension of Cui-Kano's Characterization on Graph Factors, A characterization of graphs having all \((g,f)\)-factors, Sharp conditions for the existence of an even $[a,b$-factor in a graph], Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts, The membership problem in jump systems, Quasi-Eulerian hypergraphs, Regular colorings in regular graphs, Structure theorem and algorithm on \((1,f)\)-odd subgraph, A degree condition for a graph to have \((a,b)\)-parity factors, Ryser's theorem for \(\rho\)-Latin rectangles, Characterization of 1-tough graphs using factors, Antifactors of regular bipartite graphs, Optimal general factor problem and jump system intersection, \([a,b\)-factors of graphs on surfaces], Editing graphs to satisfy degree constraints: a parameterized approach, Factors with red-blue coloring of claw-free graphs and cubic graphs, Tractable cases of the extended global cardinality constraint, Packing $k$-Matchings and $k$-Critical Graphs, Degree factors with red-blue coloring of regular graphs, On some factor theorems of graphs, A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem, Graph editing problems with extended regularity constraints, Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming, Degree constrained subgraphs, Elementary graphs with respect to \(f\)-parity factors, Factors in graphs with odd-cycle property, The Simple Reachability Problem in Switch Graphs, Monadic Second Order Logic on Graphs with Local Cardinality Constraints, Unnamed Item, Good characterizations for some degree constrained subgraphs, A characterization for graphs having strong parity factors, \(\{k,r-k\}\)-factors of \(r\)-regular graphs, On the Saxl graph of a permutation group, Path problems in skew-symmetric graphs, \(\{0, 2 \}\)-degree free spanning forests in graphs, Ore-type conditions for the existence of even \([2,b\)-factors in graphs], Graph Orientation with Edge Modifications, On Cui-Kano's Characterization Problem on Graph Factors, A Tutte-Type Characterization for Graph Factors, On edge connectivity and parity factor
Cites Work
