Short proofs on the structure of general partition, equistable and triangle graphs
From MaRDI portal
Publication:1983105
DOI10.1016/j.dam.2020.09.007zbMath1472.05124OpenAlexW3091696729WikidataQ113877256 ScholiaQ113877256MaRDI QIDQ1983105
Márcia R. Cerioli, Taísa L. Martins
Publication date: 15 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.09.007
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong cliques and equistability of EPT graphs
- On equistable, split, CIS, and related classes of graphs
- Complexity results for equistable graphs and related classes
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- Equistable series-parallel graphs
- Equistable chordal graphs
- On the complexity of the independent set problem in triangle graphs
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- A characterization and hereditary properties for partition graphs
- Recent examples in the theory of partition graphs
- Equistable simplicial, very well-covered, and line graphs
- Equistable distance-hereditary graphs
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
- Independent Domination in Triangle Graphs
- Equistable graphs
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Short proofs on the structure of general partition, equistable and triangle graphs
