JCT
2010
13 years 3 months ago
2010
JCT
2010
13 years 3 months ago
2010
JCT
2010
13 years 3 months ago
2010
In 1978, Chv´atal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest...
JCT
2010
13 years 3 months ago
2010
JCT
2010
13 years 3 months ago
2010
JCT
2010
13 years 3 months ago
2010
We prove that every 3-connected GF(q)-representable matroid that contains the projective plane, PG(2, q), as a minor is uniquely representable.
JCT
2010
13 years 3 months ago
2010
JCT
2010
13 years 3 months ago
2010
We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any v...
JCT
2010
13 years 3 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
JCT
2010
13 years 3 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...