1-Triangle graphs and perfect neighborhood sets
From MaRDI portal
Publication:5269160
DOI10.1134/S1990478917010070zbMath1374.05170OpenAlexW2590465312MaRDI QIDQ5269160
No author found.
Publication date: 15 June 2017
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478917010070
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- On equistable, split, CIS, and related classes of graphs
- The neighbourhood number of a graph
- 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
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Independent Domination in Triangle Graphs
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs
- Graph-Theoretic Concepts in Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: 1-Triangle graphs and perfect neighborhood sets