Graphs with 1-Factors
From MaRDI portal
Cited in
(60)- On component factors
- The multiplicity of 1-factors in total graphs
- On matching extensions with prescribed and proscribed edge sets. II
- Closure and Hamiltonian-connectivity of claw-free graphs
- Odd factors of a graph
- Extending matchings in claw-free graphs
- Dirac's minimum degree condition restricted to claws
- Two recursive theorems on \(n\)-extendibility
- Claw-free graphs---a survey
- Matching extension in \(K_{1,r}\)-free graphs with independent claw centers
- Quasi-claw-free graphs
- Global insertion and Hamiltonicity in DCT-graphs
- Triangles in claw-free graphs
- Equimatchable claw-free graphs
- On some graphs with a unique perfect matching
- On the complexity of some edge-partition problems for graphs
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- On the number of perfect matchings in the line graph of a traceable graph
- Index of parameters of iterated line graphs
- Extending perfect matchings to Hamiltonian cycles in line graphs
- Zero forcing in claw-free cubic graphs
- Some conditions for the existence of Euler H-trails
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- The chromatic index of a claw-free graph whose core has maximum degree 2
- Claw-free strictly Deza graphs
- Perfect matchings avoiding prescribed edges in a star-free graph
- Even cycles and perfect matchings in claw-free plane graphs
- Generalization of matching extensions in graphs. IV: Closures
- Hamiltonicity in Partly claw-free graphs
- Edge-disjoint 1-factors in powers of connected graphs
- scientific article; zbMATH DE number 3661376 (Why is no real title available?)
- Set graphs. IV. Further connections with claw-freeness
- Matchings in infinite graphs
- On the existence of 1-factors in partial squares of graphs
- Factors of claw-free graphs
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
- The maximum genus, matchings and the cycle space of a graph
- On perfect matchings and tilings in uniform hypergraphs
- A new lower bound for the number of perfect matchings of line graph
- Excessive index for mesh derived networks
- Construction of k-matchings in graph products
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
- On the dimer problem of the vertex-edge graph of a cubic graph
- Linear‐time algorithms for eliminating claws in graphs
- Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical
- Factors with red-blue coloring of claw-free graphs and cubic graphs
- Enumeration of perfect matchings of the middle graph of a graph \(G\) with \(\triangle (G) \leq 4\)
- Approximating maximum edge 2-coloring by normalizing graphs
- Graphs, disjoint matchings and some inequalities
- The complexity of the perfect matching-cut problem
- A new recursive theorem on \(n\)-extendibility
- Spectral conditions for k-extendability and k-factors of bipartite graphs
- On the three graph invariants related to matching of finite simple graphs
- Path-systems in regular graphs and bipartite graphs
- Approximating maximum edge 2-coloring by normalizing graphs
- On the number of perfect matchings of middle graphs
- Sharp mosaic dimension of matching toggle graphs, with an application to fibonaccenes
- Extending unlocked matchings in graphs
- Enumerating perfect matchings in line graphs of graphs with pendent edges
- Eliminating graphs by means of parallel knock-out schemes
This page was built for publication: Graphs with 1-Factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044631)