book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
We consider edge-coloured complete graphs. A path or cycle Q is called properly coloured (PC) if any two adjacent edges of Q differ in colour. Our note is inspired by the followi...
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...