Small cycle double covers of products I: Lexicographic product with paths and cycles
From MaRDI portal
Publication:5441405
DOI10.1002/jgt.20265zbMath1134.05086OpenAlexW4243040998MaRDI QIDQ5441405
Karen Seyffarth, Richard J. Nowakowski
Publication date: 13 February 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20265
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The pre-hull number and lexicographic product ⋮ Proper connection number of graph products ⋮ Convex sets in lexicographic products of graphs ⋮ Rainbow vertex-connection and graph products ⋮ Rainbow connection and graph products ⋮ Monochromatic connectivity and graph products ⋮ Small oriented cycle double cover of graphs ⋮ Small cycle double covers of products. II: Categorical and strong products with paths and cycles ⋮ Circuit Double Covers of Graphs
Cites Work
This page was built for publication: Small cycle double covers of products I: Lexicographic product with paths and cycles