Enumerating the edge-colourings and total colourings of a regular graph
نویسندگان
چکیده
منابع مشابه
Enumerating the edge-colourings and total colourings of a regular graph
In this paper, we are interested in computing the number of edge colourings and total colourings of a connected graph. We prove that the maximum number of k-edge-colourings of a connected k-regular graph on n vertices is k · ((k − 1)!). Our proof is constructive and leads to a branching algorithm enumerating all the k-edge-colourings of a connected k-regular graph in time O∗(((k − 1)!)) and pol...
متن کاملLoops, regular permutation sets and graph colourings
We establish a correspondence among loops, regular permutation sets and directed graphs with a suitable edge colouring and relate some algebraic properties of the loop to configurations of the associated graph.
متن کاملOn Almost-Regular Edge Colourings of Hypergraphs
We prove that if H = (V (H), E(H)) is a hypergraph, γ is an edge colouring of H, and S ⊆ V (H) such that any permutation of S is an automorphism of H, then there exists a permutation π of E(H) such that |π(E)| = |E| and π(E)\S = E \S for each E ∈ E(H), and such that the edge colouring γ′ of H given by γ′(E) = γ(π−1(E)) for each E ∈ E(H) is almost regular on S. The proof is short and elementary....
متن کاملDistance-regular graphs, MH-colourings and MLD-colourings
It is shown that the only bipartite distance regular graphs of diameter 3 which are MLDcolourable are the incidence graphs of complementary Hadamard designs.
متن کاملGraph colourings and partitions
In this paper we have investigated mainly the three colouring parameters of a graph G, viz., the chromatic number, the achromatic number and the pseudoachromatic number. The importance of their study in connection with the computational complexity, partitions, algebra, projective plane geometry and analysis were brie.y surveyed. Some new results were found along these directions. We have rede0n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2012
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-011-9448-5