68 search results - page 6 / 14 » ejc 2010 |
EJC
2010
13 years 10 months ago
2010
We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z3 2
EJC
2010
13 years 10 months ago
2010
Two different constructions are given of a rank 8 arc-transitive graph with 165 vertices and valency 8, whose automorphism group
EJC
2010
13 years 10 months ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
EJC
2010
13 years 10 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
EJC
2010
13 years 10 months ago
2010
Most of these problems were presented at the conference on Combinatorics, Geometry and Computer Science, held at CIRM, Luminy, 2-4 May 2007. I have added one problem on a similar ...