The distance matching extension in K₁,k-free graphs with high local connectedness
From MaRDI portal
Publication:2115210
Recommendations
- Distance matching extension and local structure of graphs
- Matchings and matching extensions in graphs
- scientific article; zbMATH DE number 969113
- Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
- Matching extension in \(K_{1,r}\)-free graphs with independent claw centers
Cites work
- scientific article; zbMATH DE number 1475160 (Why is no real title available?)
- scientific article; zbMATH DE number 969113 (Why is no real title available?)
- Distance matching extension and local structure of graphs
- Edge proximity and matching extension in projective planar graphs
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Extending matchings in planar graphs. IV
- Graph theory
- Matching extension and the genus of a graph
- Matching extension in \(K_{1,r}\)-free graphs with independent claw centers
- Matching extension in prism graphs
- Matchings and matching extensions in graphs
- Minimal graphs for matching extensions
- Proximity thresholds for matching extension in planar and projective planar triangulations
- The matching extendability of optimal 1-planar graphs
- The matching extension problem in general graphs is co-NP-complete
- Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs
- Toughness and matching extension in graphs
Cited in
(2)
This page was built for publication: The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115210)
