𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on finding a shortest complete cycle in an undirected graph

✍ Scribed by A. Volgenant; R. Jonker; G.A.P. Kindervater

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
329 KB
Volume
23
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on shortest cycle covers of cubic
A note on shortest cycle covers of cubic graphs
✍ Xinmin Hou; Cun-Quan Zhang πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 92 KB πŸ‘ 1 views

## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3‐cycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5‐circuits of __G_

A note on k-strongly connected orientati
A note on k-strongly connected orientations of an undirected graph
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 168 KB

Each k-strongly connected orientation of an undirect:7d I.&P A \_an be obtained from any other k-strongly connected orientation by reversing consec aLir :!I 3irected paths or circuits without destroying the k-strong connectivity.

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