On Spanning and Dominating Circuits in Graphs
From MaRDI portal
Publication:4129479
DOI10.4153/CMB-1977-034-8zbMath0357.05060MaRDI QIDQ4129479
Linda Lesniak, James E. Williamson
Publication date: 1977
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items
Spanning 2‐trails from degree sum conditions, A degree condition for spanning eulerian subgraphs, Hamilton cycles and closed trails in iterated line graphs, Bibliography on domination in graphs and some basic definitions of domination parameters, The Hamiltonian index of graphs, Finding minimum dominating cycles in permutation graphs, On the Hamiltonian index, Contractions of graphs with no spanning Eulerian subgraphs, Spanning Eulerian subgraphs and matchings, On n-hamiltonian line graphs, Supereulerian graphs, independent sets, and degree-sum conditions, The Hamiltonian index of a graph and its branch-bonds, Ore-type conditions for the existence of even \([2,b\)-factors in graphs], An Eulerian exposition, Reduced graphs of diameter two, Existence of spanning and dominating trails and circuits, On circuits and pancyclic line graphs, A result on Hamiltonian line graphs involving restrictions on induced subgraphs, A reduction method to find spanning Eulerian subgraphs, Minimum dominating cycles in 2-trees, Supereulerian graphs: A survey
