The binding number of a graph and its Anderson number

1973/12/01 by Douglas R. Woodall, D.R Woodall · 3 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #Combinatorics #DNA and Biological Computing #Discrete mathematics #Disjoint sets #Graph #Interconnection Networks and Systems #Mathematics #VLSI and FPGA Design Techniques

paper · doi:10.1016/0095-8956(73)90038-5

crossref issued 1973/12/01 · crossref published 1973/12/01 · crossref published-print 1973/12/01 · openalex publication_date 1973/12/01 · crossref created 2004/12/21 · crossref deposited 2019/01/30 · openalex created_date 2025/10/10 · crossref indexed 2026/07/03 · openalex updated_date 2026/07/29

Citations

• Tough graphs and hamiltonian circuits
• The Factorization of Linear Graphs
• On Representatives of Subsets

Cited by

• Claw-free graphs — A survey
• Toughness in Graphs – A Survey
• Glossary of graph theory [wikipedia]