Dihedral Variants of k-connected Graphs

Part of the Lecture Notes in Mathematics book series (LNM, volume 1928)

We examine dihedral variants of the concept of k-connectivity. More precisely, we consider graphs with a disconnected, separable, or two-separable representation.


Maximal Clique Cone Point Order Complex Catalan Number Homotopy Equivalent 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Personalised recommendations