How to prove that a hamiltonian graph must be 2 connected?
Posted by Bob Marley, at math.stackexchange.com,
I'm under the assumption that the starting point of a graph is not sufficient for it to be visited so that means that a…
A Textbook of Graph Theory
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Basic Results
-
Altmetric BadgeChapter 2 Directed Graphs
-
Altmetric BadgeChapter 3 Connectivity
-
Altmetric BadgeChapter 4 Trees
-
Altmetric BadgeChapter 5 Independent Sets and Matchings
-
Altmetric BadgeChapter 6 Eulerian and Hamiltonian Graphs
-
Altmetric BadgeChapter 7 Graph Colorings
-
Altmetric BadgeChapter 8 Planarity
-
Altmetric BadgeChapter 9 Triangulated Graphs
-
Altmetric BadgeChapter 10 Domination in Graphs
-
Altmetric BadgeChapter 11 Spectral Properties of Graphs