990 search results - page 13 / 198 » Sub-Graphs of Complete Graph |
COMBINATORICS
2002
13 years 7 months ago
2002
If G = Kn is the complete graph, the classical Pr
IPL
2010
13 years 4 months ago
2010
Polynomial algorithms are given for the following two problems:
JGT
2010
13 years 2 months ago
2010
We answer two open questions posed by Cameron and Nesetril concerning homomorphismhomogeneous graphs. In particular we show, by giving a characterization of these graphs, that ext...
DM
1999
13 years 7 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
JDA
2010
13 years 6 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...