The vertex leafage of chordal graphs-Reference-Cited by-同舟云学术

The vertex leafage of chordal graphs

Published:2014-05 Issue: Volume:168 Page:14-25
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Chaplick Steven,Stacho Juraj

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference21 articles.

1. A characterization of rigid circuit graphs;Buneman;Discrete Mathematics,1974

2. S. Chaplick, Path graphs and PR-trees, Ph.D. Thesis, University of Toronto, 2012.

3. What is between chordal and weakly chordal graphs?;Cohen,2008

4. P. de Caria, M. Gutierrez, Determining possible sets of leaves for spanning trees of dually chordal graphs, in: Congreso de Matemática Aplicada, Computacional e Industrial, MACI 2009, 2009, pp. 153–156.

5. Incidence matrices and interval graphs;Fulkerson;Pacific Journal of Mathematics,1965

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs;Networks;2024-04-15

2. Domination and Cut Problems on Chordal Graphs with Bounded Leafage;Algorithmica;2023-12-29

3. Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage;Algorithmica;2023-07-13

4. Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage;Lecture Notes in Computer Science;2022

5. Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage;WALCOM: Algorithms and Computation;2022