Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs-Reference-Cited by-同舟云学术

Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs

Published:2000-02 Issue:1-3 Volume:99 Page:427-442
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Dragan Feodor F.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference24 articles.

1. Characterizations of totally balanced matrices;Anstee;J. Algorithms,1984

2. C. Berge, Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind, Wiss. Zeitschr. Martin-Luther-Univ. Halle-Wittenberg, 1961, p. 114.

3. A. Brandstädt, Special graph classes — a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Duisburg, 1991.

4. G.J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs, Discrete Appl. Math. 22 (1988/89) 21–34.

5. The k-domination and k-stability problems on sun-free chordal graphs;Chang;SIAM J. Algebra Discrete Methods,1984

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

1. Independence complexes of strongly orderable graphs;Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics;2022-06-30

2. Edge erasures and chordal graphs;Electronic Journal of Graph Theory and Applications;2021-10-16

3. Strong Chordality of Graphs with Possible Loops;SIAM Journal on Discrete Mathematics;2021-01

4. Coloring squares of graphs via vertex orderings;Discrete Mathematics, Algorithms and Applications;2020-08-21

5. Computing a minimum paired-dominating set in strongly orderable graphs;Discrete Applied Mathematics;2019-01