The leafage of a chordal graph
From MaRDI portal
Publication:4222379
DOI10.7151/dmgt.1061zbMath0912.05053arXivmath/9807022OpenAlexW2072585366MaRDI QIDQ4222379
Injen Lin, Douglas B. West, Terry A. McKee
Publication date: 9 May 1999
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/9807022
Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Related Items
The neighborhood polynomial of chordal graphs, On models of directed path graphs non rooted directed path graphs, Characterizing directed path graphs by forbidden asteroids, On strict-double-bound numbers of graphs and cut sets, Strictly interval graphs: characterization and linear time recognition, Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage, Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage, Independent sets in asteroidal triple-free graphs, An efficient algorithm for counting Markov equivalent DAGs, Minimum Average Distance Clique Trees, Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract), The Neighborhood Polynomial of Chordal Graphs, Asteroidal quadruples in non rooted path graphs, Parameterized complexity of multicut in weighted trees, The diameter of AT‐free graphs, Clique trees of chordal graphs: leafage and 3-asteroidals, On the tractability of optimization problems on \(H\)-graphs, Subgraph trees in graph theory, Semilattice polymorphisms and chordal graphs, The vertex leafage of chordal graphs, Intersection representation of digraphs in trees with few leaves, On asteroidal sets in chordal graphs, Characterization of classical graph classes by weighted clique graphs, Recognizing Proper Tree-Graphs, Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage, Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage, Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs, A Decomposition Theorem for Chordal Graphs and its Applications, k-separator chordal graphs: leafage and subfamilies
