Covering a graph with cycles passing through given edges

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199710)26:2<105::AID-JGT5>3.0.CO;2-W" /><105::AID-JGT5>3.0.CO;2-W 10.1002/(SICI)1097-0118(199710)26:2<105::AID-JGT5>3.0.CO;2-WzbMath0886.05093OpenAlexW4238009048MaRDI QIDQ4362093

Hong Wang

Publication date: 28 October 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199710)26:2<105::aid-jgt5>3.0.co;2-w

zbMATH Keywords

pathscyclescoverings

Mathematics Subject Classification ID

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

Related Items (4)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A 2-factor with short cycles passing through specified independent vertices in graph ⋮ Independent triangles covering given vertices of a graph ⋮ \(k\) disjoint cycles containing specified independent vertices

This page was built for publication: Covering a graph with cycles passing through given edges