On dominating and spanning circuits in graphs
type: Item
instance of: scholarly article
title: On dominating and spanning circuits in graphs
zbMATH Open document ID: 0789.05061
DOI: 10.1016/0012-365X(92)00063-W
published in: Discrete Mathematics
publication date: 1994-03-01T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 500621
zbMATH Keywords: eulerian subgraph
zbMATH Keywords: circuit
zbMATH Keywords: Hamilton cycle
zbMATH Keywords: line graph
zbMATH Keywords: dominating circuit
zbMATH Keywords: spanning circuit
zbMATH Keywords: conjecture of Benhocine
author: Henk Jan Veldman
MaRDI profile type: Publication
cites work: On circuits and pancyclic line graphs
cites work: Q5422499
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Contractions of graphs with no spanning Eulerian subgraphs
cites work: Spanning Eulerian subgraphs and matchings
cites work: Q3983243
cites work: On hamiltonian line graphs
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
description: scientific article; zbMATH DE number 500621