The neighborhood polynomial of chordal graphs

DOI10.1007/978-3-030-83508-8_12OpenAlexW3197715870MaRDI QIDQ832856FDOQ832856

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

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

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)