990 search results - page 16 / 198 » Sub-Graphs of Complete Graph |
JCT
2007
15 years 2 months ago
2007
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic orien...
199
click to vote
OA
1989
15 years 6 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
121
click to vote
JGT
2006
15 years 2 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
120
click to vote
DM
2010
15 years 2 months ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...
111
click to vote
CPC
2004
15 years 2 months ago
2004
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...