Toughness in Graphs – A Survey

2006/04/01 by Douglas C. Bauer, Douglas Bauer, Hajo Broersma +2 · 1 citation
Computer Science · Engineering · Mathematics · Medicine · #Advanced Graph Theory Research #Arithmetic #Circumference #Combinatorics #Conjecture #Discrete mathematics #Geometry #Graph #Graph Labeling and Dimension Problems #Linguistics #Mathematics #Medicine #Mental toughness #Notation #Terminology #Toughness #graph theory and CDMA systems

paper · doi:10.1007/s00373-006-0649-0

crossref issued 2006/04/01 · crossref published 2006/04/01 · crossref published-print 2006/04/01 · openalex publication_date 2006/04/01 · crossref created 2006/04/28 · crossref deposited 2022/05/14 · openalex created_date 2025/10/10 · crossref indexed 2026/07/02 · openalex updated_date 2026/07/28

Citations

• A theorem on tait colorings with an application to the generalized Petersen graphs
• Some Theorems on Abstract Graphs
• Tough graphs and hamiltonian circuits
• Recognizing tough graphs is NP-hard
• Hamiltonian degree conditions for tough graphs
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• The binding number of a graph and its Anderson number
• Long cycles in graphs with prescribed toughness and minimum degree
• Sur le coloriage des graphs
• Pancyclic graphs I
• Graph Theory and Probability

Cited by

• Graph toughness [wikipedia]