Neighborhood unions and the cycle cover number of a graph

DOI10.1002/jgt.3190180703zbMath0814.05049OpenAlexW1995405518MaRDI QIDQ4312244

Michael S. Jacobson, Richard H. Schelp, Guantao Chen, Ronald J. Gould

Publication date: 31 May 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180703

zbMATH Keywords

cyclescoverneighborhood unionscycle cover number

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

A degree sum condition for graphs to be covered by two cycles

Cites Work

• A generalization of Dirac's theorem for \(K(1,3)\)-free graphs

This page was built for publication: Neighborhood unions and the cycle cover number of a graph