Computing the binding number of a graph
From MaRDI portal
Publication:1813976
DOI10.1016/0166-218X(90)90072-KzbMath0741.05068OpenAlexW2063221592MaRDI QIDQ1813976
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(90)90072-k
Related Items
Stability theorems for graph vulnerability parameters ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ Wiener index and vulnerability parameters of graphs ⋮ Best monotone degree conditions for binding number ⋮ Binding Number and Wheel Related Graphs ⋮ Toughness and binding number ⋮ A parameter linked with \(G\)-factors and the binding number ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Connection between conjunctive capacity and structural properties of graphs ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Recognizing tough graphs is NP-hard
- Dioïds and semirings: Links to fuzzy sets and other applications
- Perfect matchings of a graph
- Tough graphs and Hamiltonian circuits.
- Optimal attack and reinforcement of a network
- A Fast Parametric Maximum Flow Algorithm and Applications
- The binding number of a graph and its Anderson number
