GC
2007
Springer
13 years 4 months ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
GC
2007
Springer
13 years 4 months ago
2007
Springer
GC
2007
Springer
13 years 4 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
GC
2007
Springer
13 years 4 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...
GC
2007
Springer
13 years 4 months ago
2007
Springer
GC
2007
Springer
13 years 4 months ago
2007
Springer
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
GC
2007
Springer
13 years 4 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...
GC
2007
Springer
13 years 4 months ago
2007
Springer
GC
2007
Springer
13 years 4 months ago
2007
Springer
GC
2007
Springer
13 years 4 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...