The factorization of graphs. II
From MaRDI portal
Publication:5659592
Cites work
- scientific article; zbMATH DE number 3150487 (Why is no real title available?)
- scientific article; zbMATH DE number 3220175 (Why is no real title available?)
- Antisymmetrical Digraphs
- On the structure of factorizable graphs
- Paths, Trees, and Flowers
- Subgraphs with prescribed valencies
- The 1-Factors of Oriented Graphs
- The Factors of Graphs
Cited in
(48)- Good characterizations for some degree constrained subgraphs
- Ryser's theorem for \(\rho\)-Latin rectangles
- Factors with red-blue coloring of claw-free graphs and cubic graphs
- Gadget classification
- Optimal general factor problem and jump system intersection
- Equitable factorizations of edge-connected graphs
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Antifactors of regular bipartite graphs
- A characterization for graphs having strong parity factors
- Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
- Factors in graphs with odd-cycle property
- Tractable cases of the extended global cardinality constraint
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
- General factors of graphs
- An extension of Cui-Kano's characterization on graph factors
- Regular colorings in regular graphs
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Characterization of 1-tough graphs using factors
- A degree condition for a graph to have \((a,b)\)-parity factors
- \([a,b]\)-factors of graphs on surfaces
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- Path problems in skew-symmetric graphs
- Maximum and optimal 1-2 matching problem of the different kind
- Packing $k$-Matchings and $k$-Critical Graphs
- Structure theorem and algorithm on \((1,f)\)-odd subgraph
- Graph orientation with edge modifications
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- On some factor theorems of graphs
- Monadic Second Order Logic on Graphs with Local Cardinality Constraints
- The Simple Reachability Problem in Switch Graphs
- Degree factors with red-blue coloring of regular graphs
- Elementary graphs with respect to \(f\)-parity factors
- \(\{0, 2 \}\)-degree free spanning forests in graphs
- Degree constrained subgraphs
- Quasi-Eulerian hypergraphs
- A degree condition for graphs having all \((a, b)\)-parity factors
- On Cui-Kano's characterization problem on graph factors
- Editing graphs to satisfy degree constraints: a parameterized approach
- Graph editing problems with extended regularity constraints
- Vertex cut, eigenvalues, \([a,b]\)-factors and toughness of connected bipartite graphs
- A characterization of graphs having all \((g,f)\)-factors
- A Tutte-type characterization for graph factors
- Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors
- The superstar packing problem
- The membership problem in jump systems
- On the Saxl graph of a permutation group
- On edge connectivity and parity factor
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
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)
