Graph factors
From MaRDI portal
Publication:1168989
DOI10.1007/BF02579180zbMath0494.05046OpenAlexW3192960030MaRDI QIDQ1168989
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579180
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (34)
A degree condition implying ore-type condition for even \([2,b\)-factors in graphs] ⋮ Gallai-Edmonds decomposition as a pruning technique ⋮ Connected \([k,k+1\)-factors of graphs] ⋮ A characterization of graphs having all \((g,f)\)-factors ⋮ Sharp conditions for the existence of an even $[a,b$-factor in a graph] ⋮ Sufficient condition for the existence of an even \([a,b\)-factor in graph] ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ [a,b-factors of graphs] ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Extensions to 2-factors in bipartite graphs ⋮ Property (T) in density-type models of random groups ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ On the graphic matroid parity problem ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ The complexity of regular subgraph recognition ⋮ Stability number and \(f\)-factors in graphs ⋮ A sufficient condition for a graph to have \([a,b\)-factors] ⋮ Efficiently Realizing Interval Sequences ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ On some factor theorems of graphs ⋮ Hamilton decompositions of balanced complete multipartite graphs with primitive leaves ⋮ Dag Realizations of Directed Degree Sequences ⋮ Regular subpseudographs of regular pseudographs ⋮ Simplified existence theorems for \((g,f)\)-factors ⋮ On barrier sets of star-factors ⋮ A simple existence criterion for \((g<f)\)-factors ⋮ Three-regular parts of four-regular graphs ⋮ Linear-time certifying algorithms for near-graphical sequences ⋮ The method of alternating paths ⋮ Sufficient conditions for a graph to have factors ⋮ Odd factors of a graph ⋮ Relaxed and approximate graph realizations ⋮ Cycles in complementary prisms ⋮ Factors of regular graphs
Cites Work
- Unnamed Item
- Studies on directed graphs. I, II
- An extension of Tutte's 1-factor theorem
- Spanning subgraphs with specified valencies
- The Subgraph Problem
- On Representatives of Subsets
- Subgraphs with prescribed valencies
- The Factorization of Linear Graphs
- The Factors of Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Graph factors
