✦ LIBER ✦

Alternating Hamiltonian circuits in edge-coloured bipartite graphs

✍ Scribed by A.J.W. Hilton

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 241 KB
Volume: 35
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90249-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian circuits in chordal bipartit

Hamiltonian circuits in chordal bipartite graphs

✍ Haiko Müller 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 359 KB

The main result of this paper is the NP-completeness of the HAMILTONIAN CIRCUIT problem for chordal bipartite graphs. This is proved by a sophisticated reduction from SATISFIABILITY. As a corollary, HAMILTONIAN CIRCUIT is NP-complete for strongly chordal split graphs. On both classes the complexity

Properly coloured Hamiltonian paths in e

Properly coloured Hamiltonian paths in edge-coloured complete graphs

✍ J. Bang-Jensen; G. Gutin; A. Yeo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 251 KB

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 follou~ng conjecture by B. Bollobis and P. Erdijs (1976): if G is an edge-coloured complete graph on )I vertices in which the max

Alternating hamiltonian cycles in two co

Alternating hamiltonian cycles in two colored complete bipartite graphs

✍ A. G. Chetwynd; A. J. W. Hilton 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 2 views

## Abstract We give necessary and sufficient conditions for the existence of an alternating Hamiltonian cycle in a complete bipartite graph whose edge set is colored with two colors.

A Note on Alternating Cycles in Edge-Col

A Note on Alternating Cycles in Edge-Coloured Graphs

✍ Anders Yeo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is

Coloured matchings in bipartite graphs

✍ Kathie Cameron 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A theorem of states that for every n x n (n ~> 3) complete bipartite graph G such that every edge is coloured and each colour is the colour of at most two edges, there is a perfect matching whose edges have distinct colours. We give an O(n 2) algorithm for finding such a perfect matching. We show t

The edge Hamiltonian path problem is NP-

The edge Hamiltonian path problem is NP-complete for bipartite graphs

✍ Ten-Hwang Lai; Shu-Shang Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 508 KB