Abstract
A semiextension of a circuit C in a graph G provides a possible means of finding a cycle double cover of G with C as a prescribed circuit. Recently we conjectured [E.E. García Moreno, T.R. Jensen, On semiextensions and circuit double covers, J. Combin. Theory Ser. B 97 (2007) 474–482] that if G is cubic and 2-edge-connected, then a semiextension of C in G exists. If true, this would imply several long-standing conjectures. If there is a circuit C ′ in G with C ′ ≠ C and V ( C ) ⊆ V ( C ′ ) , then C ′ is called an extension of C , a special case of a semiextension. If there is no such circuit, then C is said to be stable in G . Hence the existence question for semiextensions is easy except for stable circuits. Not many examples of graphs with stable circuits have been published. In this note we show that the members of a particular class of stable circuits described by M. Kochol have semiextensions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
