1395 search results - page 39 / 279 » (k, )-Distance-Hereditary Graphs |
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
103
click to vote
JCT
2007
14 years 11 months ago
2007
A projective-planar signed graph has no two vertex-disjoint negative circles. We prove that every signed graph with no two vertex-disjoint negative circles and no balancing vertex...
DM
2008
14 years 12 months ago
2008
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either in nite or it is at most 4....
DM
2008
14 years 12 months ago
2008
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
SIAMDM
2008
14 years 11 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)