Factors and factorizations of graphs. Proof techniques in factor theory
From MaRDI portal
Publication:547467
DOI10.1007/978-3-642-21919-1zbMath1229.05001OpenAlexW2477320853MaRDI QIDQ547467
Publication date: 1 July 2011
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21919-1
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (79)
The number of disjoint perfect matchings in semi-regular graphs ⋮ Maximum and optimal 1-2 matching problem of the different kind ⋮ Spanning trees with bounded degrees and leaves ⋮ A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs] ⋮ On double-star decomposition of graphs ⋮ Tightness of sensitivity and proximity bounds for integer linear programs ⋮ An overview of graph covering and partitioning ⋮ Partitioning a Graph into Highly Connected Subgraphs ⋮ An Extension of Cui-Kano's Characterization on Graph Factors ⋮ Decomposing highly edge-connected graphs into paths of any given length ⋮ On line graphs of subcubic triangle-free graphs ⋮ Cut-edges and regular factors in regular graphs of odd degree ⋮ Colorful edge decomposition of graphs: some polynomial cases ⋮ Greedy cycles in the star graphs ⋮ Regular colorings in regular graphs ⋮ Projective normality of torus quotients of flag varieties ⋮ The existence of \(P_{\geq3}\)-factor covered graphs ⋮ Even factors in edge-chromatic-critical graphs with a small number of divalent vertices ⋮ Spanning \(k\)-ended trees of bipartite graphs ⋮ Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs ⋮ Characterization of 1-tough graphs using factors ⋮ Extensions to 2-factors in bipartite graphs ⋮ TWO RESULTS ON THE PALETTE INDEX OF GRAPHS ⋮ Edge decompositions and rooted packings of graphs ⋮ Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ \(m\)-dominating \(k\)-ended trees of graphs ⋮ Circular zero-sum \(r\)-flows of regular graphs ⋮ Existence of all generalized fractional \((g, f)\)-factors of graphs ⋮ Spanning trees whose stems are spiders ⋮ On affine-invariant two-fold quadruple systems ⋮ A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph ⋮ \(m\)-dominating \(k\)-trees of graphs ⋮ Strong Tutte type conditions and factors of graphs ⋮ Eigenvalues and parity factors in graphs with given minimum degree ⋮ Factors with red-blue coloring of claw-free graphs and cubic graphs ⋮ Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs ⋮ Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index ⋮ Degree factors with red-blue coloring of regular graphs ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ Star-factors with large components ⋮ On vertex-parity edge-colorings ⋮ On 2-factors with a bounded number of odd components ⋮ On caterpillar factors in graphs ⋮ Stability number and \(f\)-factors in graphs ⋮ Unnamed Item ⋮ Star-cycle factors of graphs ⋮ On the signed star domination number of regular multigraphs ⋮ Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs ⋮ On specific factors in graphs ⋮ The Turán number for the edge blow-up of trees ⋮ Spanning \(k\)-trees of bipartite graphs ⋮ Generalizations of marriage theorem for degree factors ⋮ Spanning trees with small diameters ⋮ Affine-invariant strictly cyclic Steiner quadruple systems ⋮ Decomposing highly connected graphs into paths of length five ⋮ Perfect matchings and \(K_{1,p}\)-restricted graphs ⋮ The large level limit of Kazama-Suzuki models ⋮ Graphs with integer matching polynomial zeros ⋮ An extension of the Win theorem: counting the number of maximum independent sets ⋮ Fractional factors, component factors and isolated vertex conditions in graphs ⋮ \((1,f)\)-factors of graphs with odd property ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ Strong \(f\)-star factors of graphs ⋮ Rainbow and properly colored spanning trees in edge-colored bipartite graphs ⋮ Lower bounds on matching energy of graphs ⋮ Induced star-triangle factors of graphs ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ On 1-sum flows in undirected graphs ⋮ Factors of bi-regular bipartite graphs ⋮ Improved queue-size scaling for input-queued switches via graph factorization ⋮ Connected \(k\)-factors in bipartite graphs ⋮ Spanning k-ended trees of 3-regular connected graphs ⋮ Vizing's and Shannon's theorems for defective edge colouring ⋮ On Cui-Kano's Characterization Problem on Graph Factors ⋮ Star decomposition of graphs ⋮ Nowhere-zero flows on signed regular graphs ⋮ A Tutte-Type Characterization for Graph Factors ⋮ Total colorings of circulant graphs ⋮ Star-like factors with large components
This page was built for publication: Factors and factorizations of graphs. Proof techniques in factor theory
