The Neighborhood Polynomial of Chordal Graphs

DOI10.46298/dmtcs.8388zbMath1520.05052MaRDI QIDQ6045410

Uwe F. Mayer, Winfried Hochstättler, Helena Bergold

Publication date: 30 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

comparability graphchordal graphdomination polynomialleafageanchor widthneighborhood polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism
• The leafage of a chordal graph

This page was built for publication: The Neighborhood Polynomial of Chordal Graphs