Computing the binding number of a graph
From MaRDI portal
Publication:1813976
DOI10.1016/0166-218X(90)90072-KzbMath0741.05068MaRDI QIDQ1813976
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C99: Graph theory
Related Items
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