Coverings of the vertices of a graph by small cycles

DOI10.1007/S00373-006-0678-8zbMATH Open1118.05078OpenAlexW1995383828MaRDI QIDQ879941FDOQ879941

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

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

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Covering the vertices of a graph with cycles of bounded length
• Covering cycles in sparse graphs
• Small cycle covers of 3-connected cubic graphs
• On cycle-double covers of graphs of small oddness
• Small \(\ell\)-edge-covers in \(k\)-connected graphs
• Shortest coverings of graphs with cycles
• An improved homogenization result for immiscible compressible two-phase flow in porous media

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)