Toughness, binding number and restricted matching extension in a graph
From MaRDI portal
Publication:2401801
DOI10.1016/j.disc.2016.10.003zbMath1369.05176OpenAlexW2556378519MaRDI QIDQ2401801
Michael D. Plummer, Akira Saito
Publication date: 5 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.10.003
Related Items
A neighborhood condition for graphs to have restricted fractional (g,f)-factors, A note on fractional ID-\( [ a , b \)-factor-critical covered graphs], Some existence theorems on path factors with given properties in graphs, Research on fractional critical covered graphs, Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the restricted matching extension of graphs on the torus and the Klein bottle
- On the restricted matching extension of graphs in surfaces
- Distance-restricted matching extension in triangulations of the torus and the Klein bottle
- Recognizing tough graphs is NP-hard
- Restricted matching in graphs of small genus
- On matching extensions with prescribed and proscribed edge sets. II
- Two results on matching extensions with prescribed and proscribed edge sets
- Extending matchings in graphs: A survey
- Binding number conditions for matching extension
- Computing the binding number of a graph
- Toughness and matching extension in graphs
- Binding number and toughness for matching extension
- Toughness and binding number
- Toughness in graphs -- a survey
- Perfect matchings of a graph
- Tough graphs and Hamiltonian circuits.
- Recent Progress in Matching Extension
- The binding number of a graph and its Anderson number
- On restricted matching extension in planar graphs
