Unmixed r-partite graphs
From MaRDI portal
Abstract: Unmixed bipartite graphs have been characterized by Ravadra and Villarreal independently. Our aim in this paper is to characterize unmixed r-partite graphs under a certain condition, witch is a generalization of villarreal's theorem on bipartite graphs. Also we give some examples and counterexamples in relevance this subject.
Recommendations
- Unmixed \(d\)-uniform \(r\)-partite hypergraphs.
- scientific article
- Uniquely partitionable graphs
- scientific article; zbMATH DE number 4191687
- Unmixed bipartite graphs and sublattices of the Boolean lattices
- On the partition dimension of unicyclic graphs
- On the connected partition dimension of unicyclic graphs
- Unmixed graphs that are domains
- Unmixedness of some weighted oriented graphs
- Integral complete \(r\)-partite graphs
Cited in
(8)- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Partitions and well-coveredness: the graph sandwich problem
- Unmixedness of some weighted oriented graphs
- A generalization of Villarreal's result for unmixed tripartite graphs
- Unmixed graphs that are domains
- scientific article; zbMATH DE number 5348111 (Why is no real title available?)
- Unmixed \(d\)-uniform \(r\)-partite hypergraphs.
- Cohen-Macaulayness in a small class of r-partite graphs
This page was built for publication: Unmixed r-partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613761)
