Vertex set partitions preserving conservativeness

DOI10.1006/JCTB.2000.1972MaRDI QIDQ1850496zbMATH OpenOpenAlexFDO

Authors Alexander Ageev, Alexandr 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)

Recommendations

• A characterization and hereditary properties for partition graphs
• On partition graphs
• Convex \(p\)-partitions of bipartite graphs
• Generalized partitions of graphs
• scientific article; zbMATH DE number 3889586

Cites work

• scientific article; zbMATH DE number 808809 (Why is no real title available?)
• scientific article; zbMATH DE number 878892 (Why is no real title available?)
• A characterization of Seymour graphs
• Matching theory
• On Odd Cuts and Plane Multicommodity Flows
• On shortest T-joins and packing T-cuts
• The matroids with the max-flow min-cut property
• Tight integral duality gap in the Chinese postman problem
• Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts
• Undirected distances and the postman-structure of graphs

Cited in

(2)

• On a min--max theorem on bipartite graphs
• Interior vertices in set partitions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850496)