Advertisement

Abstract

A graph is an ordered pair of sets (V,E) such that E is a subset of the set \( \left( {\mathop {}\limits_2^v } \right)\) of unordered pairs of elements of V. The set V = V (G) is the set of vertices and E = E(G) is the set of edges. The vertices u and v are the endvertices of this edge and we also say that u, v are adjacent vertices in G.

Keywords

Bipartite Graph Planar Graph Tree Decomposition Degree Sequence Chordal Graph 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Vieweg+Teubner | GWV Fachverlage GmbH 2010

Authors and Affiliations

  • Martin Loebl
    • 1
  1. 1.Department of Applied Mathematics, Institut of Theoretical Computer ScienceCharles UniversityPrahaTschechische Republik

Personalised recommendations