The neighborhood polynomial of chordal graphs

DOI10.1007/978-3-030-83508-8_12MaRDI QIDQ832856zbMATH OpenOpenAlexFDO

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

Publication date 25 March 2022

Full work available at URL https://arxiv.org/abs/2008.08349

zbMATH Keywords

domination polynomialchordal graphcomparability graphleafageanchor widthneighborhood polynomial

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A Linear Recognition Algorithm for Cographs
• Dominating Sets in Chordal Graphs
• Dominating sets for split and bipartite graphs
• Graph operations and neighborhood polynomials
• Kneser's conjecture, chromatic number, and homotopy
• Neighborhood and domination polynomials of graphs
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• Representing triangulated graphs in stars
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• The leafage of a chordal graph
• The neighbourhood polynomial of a graph

Cited in

(3)

• The Neighborhood Polynomial of Chordal Graphs
• The Neighborhood Polynomial of Chordal Graphs
• Chordal graphs and the characteristic polynomial

This page was built for publication: The neighborhood polynomial of chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832856)