New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs

DOI10.1007/978-3-642-17461-2_17zbMath1311.05159OpenAlexW1523055524MaRDI QIDQ3066459

R. Sritharan, Feodor F. Dragan, Arthur H. Busch

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_17

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

POWERS OF BINOMIAL EDGE IDEALS WITH QUADRATIC GRÖBNER BASES ⋮ Matchings, coverings, and Castelnuovo-Mumford regularity ⋮ Regularity of powers of bipartite graphs ⋮ Upper bounds for the regularity of powers of edge ideals of graphs ⋮ Upper bounds for the regularity of symbolic powers of certain classes of edge ideals ⋮ Vertex cover at distance on \(H\)-free graphs