Coverings of the vertices of a graph by small cycles

DOI10.1007/s00373-006-0678-8zbMath1118.05078OpenAlexW1995383828MaRDI QIDQ879941

Mekkia Kouider, David L. 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)

Related Items (2)

An improved homogenization result for immiscible compressible two-phase flow in porous media ⋮ Covering the vertices of a graph with cycles of bounded length

Cites Work

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

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