Publication:3527613

zbMath1171.05405arXivmath/0606479MaRDI QIDQ3527613

Rafael H. Villarreal

Publication date: 29 September 2008

Full work available at URL: https://arxiv.org/abs/math/0606479

zbMATH Keywords

bipartite graph; unmixed graph; König theorem; minimal vertex cover

Mathematics Subject Classification ID

05C90: Applications of graph theory

13H10: Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.)

05C75: Structural characterization of families of graphs

Related Items

Stanley-Reisner Rings, Cohen-Macaulay bipartite graphs in arbitrary codimension, The powers of unmixed bipartite edge ideals, Cohen-Macaulay edge ideal whose height is half of the number of vertices, Gorenstein homogeneous subrings of graphs, Equality of ordinary and symbolic powers of some classes of monomial ideals, On well-covered, vertex decomposable and Cohen-Macaulay graphs, Matchings, coverings, and Castelnuovo-Mumford regularity, Vertex decomposability and regularity of very well-covered graphs, Cohen-Macaulayness of bipartite graphs, revisited, Shellable graphs and sequentially Cohen-Macaulay bipartite graphs, Unmixed bipartite graphs and sublattices of the Boolean lattices, Regularity, depth and arithmetic rank of bipartite edge ideals, An alternative proof of a characterization of Cohen-Macaulay bipartite graphs, Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity, Regularity of powers of bipartite graphs, On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph, Partitions and well-coveredness: the graph sandwich problem, A brief survey on pure Cohen-Macaulayness in a fixed codimension, Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type, Freiman cover ideals of unmixed bipartite graphs, On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs