Computing the binding number of a graph
From MaRDI portal
Recommendations
- The binding number of a digraph and its computation
- scientific article; zbMATH DE number 431470
- scientific article; zbMATH DE number 125450
- Publication:4726285
- scientific article; zbMATH DE number 4035879
- scientific article; zbMATH DE number 165528
- scientific article; zbMATH DE number 5613476
- The binding number of a graph and its circuits
- scientific article; zbMATH DE number 861362
- The binding number of a graph and its cliques
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3735875 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- Dioïds and semirings: Links to fuzzy sets and other applications
- Optimal attack and reinforcement of a network
- Perfect matchings of a graph
- Recognizing tough graphs is NP-hard
- The binding number of a graph and its Anderson number
- Tough graphs and Hamiltonian circuits.
Cited in
(11)- Wiener index and vulnerability parameters of graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Toughness and binding number
- Binding number and wheel related graphs
- Connection between conjunctive capacity and structural properties of graphs
- Stability theorems for graph vulnerability parameters
- Toughness, binding number and restricted matching extension in a graph
- Computing the largest bond of a graph
- Best monotone degree conditions for graph properties: a survey
- A parameter linked with \(G\)-factors and the binding number
- Best monotone degree conditions for binding number
This page was built for publication: Computing the binding number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813976)
