Recommendations
Cites work
- scientific article; zbMATH DE number 434906 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1286748 (Why is no real title available?)
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Complexity results for well‐covered graphs
- On maximal independent sets of vertices in claw-free graphs
- On well-covered triangulations. I
- On well-covered triangulations. II.
- Some covering concepts in graphs
- The structure of well-covered graphs and the complexity of their recognition problems
- Triangles with restricted degree sum of their boundary vertices in plane graphs
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- WELL-COVERED GRAPHS: A SURVEY
- Well-covered claw-free graphs
Cited in
(15)- On well-covered quadrangulations
- S^2 coverings by isosceles and scalene triangles – adjacency case I
- Well-covered triangulations. IV
- Graphs with maximal induced matchings of the same size
- On the structure of 4-regular planar well-covered graphs
- Constructions for well-covered graphs
- Vertex-transitive CIS graphs
- Well-hued graphs
- On well-covered triangulations. II.
- Triangulations and equality in the domination chain
- On well-covered triangulations. I
- On well-covered direct products
- scientific article; zbMATH DE number 57414 (Why is no real title available?)
- scientific article; zbMATH DE number 4217869 (Why is no real title available?)
- On well-covered pentagonalizations of the plane
This page was built for publication: On well-covered triangulations. III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972324)