199 search results - page 13 / 40 » Connectivity of addable graph classes |
DM
2006
13 years 7 months ago
2006
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
COMBINATORICS
2006
13 years 7 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
TCS
2008
13 years 7 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
CAS
2008
13 years 7 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...