686 search results - page 43 / 138 » Packing Cycles in Graphs |
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
102
click to vote
AAIM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
JGT
2007
15 years 9 days ago
2007
: A (directed) cycle C in a graph is called consistent provided there exists an automorphism of , acting as a 1-step rotation of C. A beautiful but not well-known result of J.H. Co...
124
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
75
Voted
SIAMDM
2010
14 years 7 months ago
2010
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at