On \(\alpha\)-excellent graphs
From MaRDI portal
Publication:2683166
DOI10.1007/s40840-022-01456-0OpenAlexW4316469491MaRDI QIDQ2683166
Jerzy Topp, Michael A. Henning, Magda Dettlaff
Publication date: 3 February 2023
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.08498
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- On domination and independence numbers of graphs
- On simple characterizations of k-trees
- Independent domination in graphs: A survey and recent results
- On weakly connected domination in graphs. II.
- WELL-COVERED GRAPHS: A SURVEY
- Well covered simplicial, chordal, and circular arc graphs
- Some covering concepts in graphs
- 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: On \(\alpha\)-excellent graphs