Vertex set partitions preserving conservativeness

DOI10.1006/jctb.2000.1972zbMath1027.05078OpenAlexW2085269308MaRDI QIDQ1850496

A. A. Ageev, Alexandr V. Kostochka

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2000.1972

zbMATH Keywords

conservative graphSeymour graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

On a min--max theorem on bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• Undirected distances and the postman-structure of graphs
• Tight integral duality gap in the Chinese postman problem
• On shortest \(T\)-joins and packing \(T\)-cuts
• The matroids with the max-flow min-cut property
• Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts
• A characterization of Seymour graphs
• On Odd Cuts and Plane Multicommodity Flows

This page was built for publication: Vertex set partitions preserving conservativeness