Packing cycles in graphs. II
type: Item
instance of: scholarly article
title: Packing cycles in graphs. II
zbMATH Open document ID: 1024.05048
DOI: 10.1016/S0095-8956(02)00007-2
author: Guoli Ding
author: Zhenzhen Xu
author: Wenan Zang
published in: Journal of Combinatorial Theory. Series B
publication date: 2003-08-25T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1970688
MaRDI profile type: Publication
cites work: A Min-Max Theorem on Feedback Vertex Sets
cites work: An approximation algorithm for feedback vertex sets in tournaments
cites work: Packing cycles in graphs
cites work: Q4198056
cites work: Packing directed circuits exactly
cites work: On two minimax theorems in graph
cites work: A Minimax Theorem for Directed Graphs
cites work: Packing circuits in eulerian digraphs
Recommended article: Packing cycles in graphs
Recommended article: Cycle packings in graphs and digraphs
Recommended article: Packing cycles in complete graphs
Recommended article: Packing cycles in undirected graphs
Recommended article: Q4796199
Recommended article: Cycle packings of the complete multigraph
Recommended article: On packing shortest cycles in graphs
Recommended article: Packing cycles in undirected group-labelled graphs
Recommended article: Packing edge-disjoint cycles in graphs and the cyclomatic number
Recommended article: Q4304570
description: scientific article; zbMATH DE number 1970688