The Factors of Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Approximation algorithm for maximum edge coloring
- Packing trees with constraints on the leaf degree
- The stability number and connected \([k,k+1]\)-factor in graphs
- Degree condition for the existence of a k-factor containing a given Hamiltonian cycle
- Degree and stability number condition for the existence of connected factors in graphs
- Bounds on maximum \(b\)-matchings
- Minimal 2-matching-covered graphs
- Coloring by two-way independent sets
- 4-factors in 2-connected star-free graphs
- Linear-time certifying algorithms for near-graphical sequences
- The method of alternating paths
- Disjoint paths in a rectilinear grid
- Minimum degree of a graph and the existence of k-factors
- Factors of regular graphs
- Parity results on connected f-factors
- The number of trees with a 1-factor
- General factors of graphs
- Fractional matchings and the Edmonds-Gallai theorem
- Matchings in infinite graphs
- Constructing a perfect matching is in random NC
- Toughness and the existence of k-factors. II
- A graphical proof of the nonexistence of BIB(7,b,r,3,\(\lambda\) \(| 16)\) designs
- Factors and induced subgraphs
- A matching problem with side conditions
- f-factors and related decompositions of graphs
- Subgraphs and their degree sequences of a digraph
- Generalized 1-factorization of trees
- Graph factors
- Trees with 1-factors and oriented trees
- On the use of augmenting chains in chain packings
- An Ore-type condition for the existence of \(k\)-factors in graphs
- One-factors and \(k\)-factors
- On some factor theorems of graphs
- Infinite matching theory
- Binding numbers and f-factors of graphs
- Compatible 2-factors
- Matching theory -- a sampler: From Dénes König to the present
- Factors in graphs with odd-cycle property
- An extension of Tutte's 1-factor theorem
- Über ein graphentheoretisches Problem von T. Gallai
- Factors of trees
- Regular factors in vertex-deleted subgraphs of regular graphs
- Connected \([k,k+1]\)-factors of graphs
- List edge and list total colourings of multigraphs
- A characterization of graphs having all (g,f)-factors
- The membership problem in jump systems
- Maximum balanced flow in a network
- Regular factors of simple regular graphs and factor-spectra
- Matchings and matching extensions in graphs
- \(k\)-regular factors and semi-\(k\)-regular factors in graphs
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On barrier sets of star-factors
- Toughness of graphs and the existence of factors
- On f-factors of a graph
- Generalized edge packings
- Packing paths of length at least two
- Spanning subgraphs with specified valencies
- Disconnected 2-factors in planar cubic bridgeless graphs
- Complete-factors and (\(g,f\))-factors
- Minimum degree, independence number and regular factors
- Toughness, hamiltonicity and split graphs
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- Degree sequences and the existence of k-factors
- Chordality and 2-factors in tough graphs
- \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
- Lower bounds on matching energy of graphs
- Regular graph and some vertex-deleted subgraph
- Connected \(k\)-factors in bipartite graphs
- The existence of path-factor covered graphs
- Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
- Note on a zero net-regular signed graph
- A factorization theorem for a certain class of graphs
- On the minimum energy of regular graphs
- Finite homogeneous metric spaces
- Bipartite double cover and perfect 2-matching covered graph with its algorithm
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Graph realizations constrained by skeleton graphs
- Regular factors in regular graphs
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- Spanning trees with leaf distance at least \(d\)
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- On the complexity landscape of connected \(f\)-factor problems
- An algorithmic approach to dual integrality of matching and extensions
- On perfect k-matchings
- Factors and vertex-deleted subgraphs
- Spanning subgraphs with specified valencies. (Reprint)
- Finding maximum square-free 2-matchings in bipartite graphs
- The f-factor problem for graphs and the hereditary property
- Extreme degree sequences of simple graphs
- On \((g,f)\)-uniform graphs
- Maximal-\(\Gamma\)-prime Graphen
- \(P_3\)-factors in the square of a tree
- Cut-edges and regular factors in regular graphs of odd degree
- Maximal sets of 2-factors in complete equipartite graphs
- Balanced network flows. IV: Duality and structure theory.
- A pair of forbidden subgraphs and 2-factors
- Regular graphs, eigenvalues and regular factors
- Binding number and minimum degree for k-factors
This page was built for publication: The Factors of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5816402)
