Cited By
View all- Fleischner HHäggkvist R(2018)Cycle Double Covers in Cubic Graphs having Special StructuresJournal of Graph Theory10.1002/jgt.2177977:2(158-170)Online publication date: 31-Dec-2018
Define a graph to be a Kotzig graph if it is m-regular and has an m-edge colouring in which each pair of colours form a Hamiltonian cycle. We show that every cubic graph with spanning subgraph consisting of a subdivision of a Kotzig graph together with ...
In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi's compatibility conjecture, Discrete Math. 244 (2002) 77-82] about edge-disjoint bipartizing matchings of a cubic graph with a dominating circuit are ...
A finite, undirected graph is called locally connected, if the neighborhood of every vertex induces a connected subgraph. In this paper we study the existence of edges in locally connected k-connected graphs whose contraction keeps the graph locally ...
Springer-Verlag
Berlin, Heidelberg
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in