An extension of Tutte's 1-factor theorem

From MaRDI portal
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

About a new class of matroid-inducing packing families, The superstar packing problem, Packings by Complete Bipartite Graphs, On matroids induced by packing subgraphs, Optimal packing of induced stars in a graph, Graph factors and factorization: 1985--2003: a survey, Fractional matchings, component-factors and edge-chromatic critical graphs, Unnamed Item, Induced graph packing problems, Some results about ID-path-factor critical graphs, Remarks on component factors, Unnamed Item, Isolated toughness and path-factor uniform graphs. II., Two Sufficient Conditions for Graphs to Admit Path Factors, Strong Tutte type conditions and factors of graphs, Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index, Packing $k$-Matchings and $k$-Critical Graphs, The \(A_\alpha\)-spectral radius for path-factors in graphs, Star-cycle factors of graphs, Star-uniform graphs, Graph factors, Ramsey numbers of path-matchings, covering designs, and 1-cores, On some factor theorems of graphs, Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius, Packing in honeycomb networks, Constructive proof of deficiency theorem of \((g,f)\)-factor, Strong \(f\)-star factors of graphs, Nontrivial path covers of graphs: existence, minimization and maximization, Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs, Simplified existence theorems for \((g,f)\)-factors, A simple existence criterion for \((g<f)\)-factors, Induced star-triangle factors of graphs, On Cui-Kano's Characterization Problem on Graph Factors, On factors with all degrees odd, Some results on path-factor critical avoidable graphs



Cites Work