Coverings of the vertices of a graph by small cycles

DOI10.1007/S00373-006-0678-8MaRDI QIDQ879941zbMATH OpenOpenAlexFDO

Authors Mekkia Kouider, David Forge

Publication date 10 May 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-006-0678-8

zbMATH Keywords

PathsVertex covering

Mathematics Subject Classification ID

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

Recommendations

• Covering the vertices of a graph with cycles of bounded length
• Covering a graph with cycles
• Neighborhoods and covering vertices by cycles
• Covering a graph with cycles of length at least 4
• Covering vertices by cycles

Cites work

• Covering cycles and \(k\)-term degree sums
• Neighborhood unions and hamilton cycles
• Neighborhoods and covering vertices by cycles
• Some Theorems on Abstract Graphs

Cited in

(9)

• Covering the vertices of a graph with cycles of bounded length
• Stability for vertex cycle covers
• Small \(\ell\)-edge-covers in \(k\)-connected graphs
• scientific article; zbMATH DE number 1556750 (Why is no real title available?)
• An improved homogenization result for immiscible compressible two-phase flow in porous media
• On cycle-double covers of graphs of small oddness
• Covering cycles in sparse graphs
• Small cycle covers of 3-connected cubic graphs
• Shortest coverings of graphs with cycles

This page was built for publication: Coverings of the vertices of a graph by small cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879941)