An extension of Tutte's 1-factor theorem

From MaRDI portal
Revision as of 09:27, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1256496

DOI10.1016/0012-365X(78)90006-7zbMath0404.05048MaRDI QIDQ1256496

Michel Las Vergnas

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)




Related Items (35)

About a new class of matroid-inducing packing familiesThe superstar packing problemPackings by Complete Bipartite GraphsOn matroids induced by packing subgraphsOptimal packing of induced stars in a graphGraph factors and factorization: 1985--2003: a surveyFractional matchings, component-factors and edge-chromatic critical graphsUnnamed ItemInduced graph packing problemsSome results about ID-path-factor critical graphsRemarks on component factorsUnnamed ItemIsolated toughness and path-factor uniform graphs. II.Two Sufficient Conditions for Graphs to Admit Path FactorsStrong Tutte type conditions and factors of graphsComplete characterization of path-factor and path-factor covered graphs via Q -index and D -indexPacking $k$-Matchings and $k$-Critical GraphsThe \(A_\alpha\)-spectral radius for path-factors in graphsStar-cycle factors of graphsStar-uniform graphsGraph factorsRamsey numbers of path-matchings, covering designs, and 1-coresOn some factor theorems of graphsCharacterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radiusPacking in honeycomb networksConstructive proof of deficiency theorem of \((g,f)\)-factorStrong \(f\)-star factors of graphsNontrivial path covers of graphs: existence, minimization and maximizationSun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphsSimplified existence theorems for \((g,f)\)-factorsA simple existence criterion for \((g<f)\)-factorsInduced star-triangle factors of graphsOn Cui-Kano's Characterization Problem on Graph FactorsOn factors with all degrees oddSome results on path-factor critical avoidable graphs



Cites Work




This page was built for publication: An extension of Tutte's 1-factor theorem