The factorization of graphs. II

From MaRDI portal
Revision as of 04:22, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5659592

DOI10.1007/BF01889919zbMath0247.05155OpenAlexW2077574397MaRDI QIDQ5659592

No author found.

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




Related Items (46)

Maximum and optimal 1-2 matching problem of the different kindGadget classificationGeneral factors of graphsEquitable factorizations of edge-connected graphsSufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors] ⋮ The superstar packing problemAn Extension of Cui-Kano's Characterization on Graph FactorsA characterization of graphs having all \((g,f)\)-factorsSharp 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 cutsThe membership problem in jump systemsQuasi-Eulerian hypergraphsRegular colorings in regular graphsStructure theorem and algorithm on \((1,f)\)-odd subgraphA degree condition for a graph to have \((a,b)\)-parity factorsRyser's theorem for \(\rho\)-Latin rectanglesCharacterization of 1-tough graphs using factorsAntifactors of regular bipartite graphsOptimal general factor problem and jump system intersection\([a,b\)-factors of graphs on surfaces] ⋮ Editing graphs to satisfy degree constraints: a parameterized approachFactors with red-blue coloring of claw-free graphs and cubic graphsTractable cases of the extended global cardinality constraintPacking $k$-Matchings and $k$-Critical GraphsDegree factors with red-blue coloring of regular graphsOn some factor theorems of graphsA \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problemGraph editing problems with extended regularity constraintsParameterized complexity results for general factors in bipartite graphs with an application to constraint programmingDegree constrained subgraphsElementary graphs with respect to \(f\)-parity factorsFactors in graphs with odd-cycle propertyThe Simple Reachability Problem in Switch GraphsMonadic Second Order Logic on Graphs with Local Cardinality ConstraintsUnnamed ItemGood characterizations for some degree constrained subgraphsA characterization for graphs having strong parity factors\(\{k,r-k\}\)-factors of \(r\)-regular graphsOn the Saxl graph of a permutation groupPath problems in skew-symmetric graphs\(\{0, 2 \}\)-degree free spanning forests in graphsOre-type conditions for the existence of even \([2,b\)-factors in graphs] ⋮ Graph Orientation with Edge ModificationsOn Cui-Kano's Characterization Problem on Graph FactorsA Tutte-Type Characterization for Graph FactorsOn edge connectivity and parity factor




Cites Work




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