The Factorization of Linear Graphs

Cited in

(only showing first 100 items - show all)

Conditional matching preclusion sets
Degree condition for the existence of a k-factor containing a given Hamiltonian cycle
Bounds on maximum \(b\)-matchings
Edge-deletable IM-extendable graphs with minimum number of edges
Linear-time certifying algorithms for near-graphical sequences
Short proofs on the matching polyhedron
The Edmonds-Gallai decomposition for matchings in locally finite graphs
An extension of matching theory
On factors with all degrees odd
Packings by cliques and by finite families of graphs
Maximum matchings in a class of random graphs
Matching is as easy as matrix inversion
Matchings in infinite graphs
Edge-colouring random graphs
Matching structure and the matching lattice
NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
Spanning Eulerian subgraphs and matchings
The two ear theorem on matching-covered graphs
On n-extendable graphs
Matroid matching and some applications
Matrices of zeros and ones with fixed row and column sum vectors
f-factors and related decompositions of graphs
Subgraphs and their degree sequences of a digraph
On generalized matching problems
A new linear programming algorithm - better or worse than the simplex method?
Matchings in regular graphs
On two-factors of bipartite regular graphs
Graph factors
One-factor in random graphs based on vertex choice
A new family of finite solutions
Trees with 1-factors and oriented trees
The image of weighted combinatorial problems
An introduction to randomized algorithms
The symbiotic relationship of combinatorics and matrix theory
On the tree packing problem
A structure theorem for maximum internal matchings in graphs
Directed star decompositions of directed multigraphs
Infinite matching theory
Detecting cycles through three fixed vertices in a graph
Matching theory -- a sampler: From Dénes König to the present
Matchings in graphs. II
On defect-d matchings in graphs
An introduction to matching polynomials
On small graphs critical with respect to edge colourings
Equipartite colorings in graphs and hypergraphs
A note on 1-factors in certain regular multigraphs
Every connected regular graph of even degree is a Schreier coset graph
A note on 1-factors in graphs
The number of 1-factors in 2k-connected graphs
An extension of Tutte's 1-factor theorem
The optimal path-matching problem
Pfaffian structures and critical problems in finite symplectic spaces
A degree condition for the existence of 1-factors in graphs or their complements
Hadwiger's conjecture for \(K_ 6\)-free graphs
Odd factors of a graph
Extending matchings in graphs: A survey
Factors of trees
Protecting convex sets
Graph-theoretical conditions for inscribability and Delaunay realizability
The \(\beta\)-assignment problem in general graphs
Quasi-claw-free graphs
Expressions for the perfect matching numbers of cubic l m n lattices and their asymptotic values
On a min--max theorem on bipartite graphs
Clique minors in graphs and their complements
Capacities of graphs and \(2\)-matchings
\(k\)-regular factors and semi-\(k\)-regular factors in graphs
Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs
Matching connectivity: on the structure of graphs with perfect matchings
\(d\)-matching in 3-uniform hypergraphs
Strong matching preclusion number of graphs
Some results on the inverse sum indeg index of a graph
Matching preclusion number of graphs
Perfect matching covers of cubic graphs of oddness 2
Computing girth and cogirth in perturbed graphic matroids
Structural results on matching estimation with applications to streaming
Eigenvalues and perfect matchings
Integer sets with prescribed pairwise differences being distinct
On packing Hamilton cycles in \(\varepsilon\)-regular graphs
Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
An identity for matching and skew-symmetric determinant
Simplified existence theorems for \((g,f)\)-factors
Spanning subgraphs with specified valencies
A short proof of Mader's \(\mathcal S\)-paths theorem
Disconnected 2-factors in planar cubic bridgeless graphs
Tight bounds on maximal and maximum matchings
A generalisation of matching and colouring
Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
Binding number and toughness for matching extension
Minimum degree, independence number and regular factors
A generalization of Little's theorem on Pfaffian orientations
The total domination subdivision number in graphs with no induced 3-cycle and 5-cycle
Polyhedron of triangle-free simple 2-matchings in subcubic graphs
Forbidden induced subgraphs for perfect matchings
Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
On pseudomatroid property of matrices
Degree conditions of induced matching extendable graphs
On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
Enumerating alternating matrix spaces over finite fields with explicit coordinates
Perfect matchings and \(K_{1,p}\)-restricted graphs
The cyclic edge-connectivity of strongly regular graphs

This page was built for publication: The Factorization of Linear Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5785127)