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 (27)
The Hamiltonian index of a graph and its branch-bonds ⋮ On the Hamiltonian index ⋮ Existence of spanning and dominating trails and circuits ⋮ Searching for a cycle with maximum coverage in undirected graphs ⋮ Contractions of graphs with no spanning Eulerian subgraphs ⋮ Reduced graphs of diameter two ⋮ An Eulerian exposition ⋮ On circuits and pancyclic line graphs ⋮ Supereulerian graphs, independent sets, and degree-sum conditions ⋮ Supereulerian graphs: A survey ⋮ Spanning Eulerian subgraphs and matchings ⋮ Fan-type conditions for spanning Eulerian subgraphs ⋮ On computing the Hamiltonian index of graphs ⋮ A result on Hamiltonian line graphs involving restrictions on induced subgraphs ⋮ A reduction method to find spanning Eulerian subgraphs ⋮ Lai's conditions for spanning and dominating closed trails ⋮ On n-hamiltonian line graphs ⋮ Hamilton cycles and closed trails in iterated line graphs ⋮ Minimum dominating cycles in 2-trees ⋮ The Hamiltonian index of graphs ⋮ A degree condition for spanning eulerian subgraphs ⋮ Spanning 2‐trails from degree sum conditions ⋮ Perfect matching dominating cycle — a new dominating cycle ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ Ore-type conditions for the existence of even \([2,b\)-factors in graphs] ⋮ Finding minimum dominating cycles in permutation graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: On Spanning and Dominating Circuits in Graphs
