The neighborhood polynomial of chordal graphs
From MaRDI portal
Publication:832856
DOI10.1007/978-3-030-83508-8_12OpenAlexW3197715870MaRDI QIDQ832856
Helena Bergold, Winfried Hochstättler, Uwe F. Mayer
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2008.08349
Cites Work
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Dominating sets for split and bipartite graphs
- Representing triangulated graphs in stars
- Neighborhood and domination polynomials of graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Graph operations and neighborhood polynomials
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- A Linear Recognition Algorithm for Cographs
- Dominating Sets in Chordal Graphs
- The leafage of a chordal graph
This page was built for publication: The neighborhood polynomial of chordal graphs