601 search results - page 18 / 121 » Edge-dominating cycles in graphs |
119
click to vote
IPL
2002
15 years 1 months ago
2002
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
JGAA
2007
15 years 1 months ago
2007
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
DM
2010
15 years 2 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
101
click to vote
EJC
2006
15 years 1 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
160
click to vote
ICFP
2012
ACM
13 years 4 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...