Un problema sobre doble recorrido en grafos cúbicos

• Autores: David Soler Fernández
• Localización: Revista de la Academia Canaria de Ciencias: = Folia Canariensis Academiae Scientiarum, ISSN 1130-4723, Vol. 9, Nº. 1, 1997, págs. 125-130
• Idioma: español
• Enlaces
  • Texto completo
• Resumen

  • lt is known in Graph Throry thal a cubic graph with a verlicrs numbrr mu/tiple of 4, does nol admil a bidireclional double tracing witlioul U-turns. that is, wilhout lmvcrsing thc same edge two times consec11 /ivcly. Bu/, which is thc minimum nmnbcr of U-turns lhat a bidireclional doublr lracing makes 01'cr such kinds of graph. '? We prove in this paper thal if a cubic graph C: with a vcrlicr.s numbe1· mu/tiple of 4, has cyclic edge-conneclivity grraifr lha11 3. or rqual lo :J -if in this last rase it has only one 3-cyclic edgr cnl-, then C admits a bidi recl io11 al doublc lraáng wilh. only one U-turn.