
Cycle Intersection Graphs and Minimum Decycling Sets of Even Graphs
We introduce the cycle intersection graph of a graph, an adaptation of t...
read it

A 2^O(k)n algorithm for kcycle in minorclosed graph families
Let 𝒞 be a proper minorclosed family of graphs. We present a randomized...
read it

Decomposition of (2k+1)regular graphs containing special spanning 2kregular Cayley graphs into paths of length 2k+1
A P_ℓdecomposition of a graph G is a set of paths with ℓ edges in G tha...
read it

Cop number of graphs without long holes
A hole in a graph is an induced cycle of length at least 4. We give a si...
read it

Generalized bent Boolean functions and strongly regular Cayley graphs
In this paper we define the (edgeweighted) Cayley graph associated to a...
read it

Graphs where Search Methods are Indistinguishable
Graph searching is one of the simplest and most widely used tools in gra...
read it

Even Circuits in Oriented Matroids
In this paper we generalise the even directed cycle problem, which asks ...
read it
Fast recognition of some parametric graph families
We identify all [1, λ, 8]cycle regular Igraphs and all [1, λ, 8]cycle regular double generalized Petersen graphs. As a consequence we describe linear recognition algorithms for these graph families. Using structural properties of folded cubes we devise a o(N log N) recognition algorithm for them. We also study their [1,λ,4], [1,λ,6] and [2, λ, 6]cycle regularity and settle the value of parameter λ.
READ FULL TEXT
Comments
There are no comments yet.