You have Guest access.
Log In
Jakob Jonsson
Front matter
3-17
Introduction and Overview
19-28
Abstract Graphs and Set Systems
29-47
Simplicial Topology
51-66
Discrete Morse Theory
67-86
Decision Trees
87-95
Miscellaneous Results
99-106
Graph Properties
107-112
Dihedral Graph Properties
113-118
Digraph Properties
119-124
Main Goals and Proof Techniques
127-149
Matchings
151-168
Graphs of Bounded Degree
171-188
Forests and Matroids
189-204
Bipartite Graphs
205-215
Directed Variants of Forests and Bipartite Graphs
217-231
Noncrossing Graphs
233-242
Non-Hamiltonian Graphs
245-262
Disconnected Graphs
263-273
Not 2-connected Graphs
275-290
Not 3-connected Graphs and Beyond
291-300
Dihedral Variants of k -connected Graphs
301-308
Directed Variants of Connected Graphs
309-325
Not 2-edge-connected Graphs
329-331
Graphs Avoiding k -matchings
333-335
t -colorable Graphs
337-354
Graphs and Hypergraphs with Bounded Covering Number
357-362
Open Problems
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info