Biconvex graphs: ordering and algorithms-Reference-Cited by-同舟云学术

Biconvex graphs: ordering and algorithms

Published:2000-07 Issue:1-3 Volume:103 Page:1-19
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Abbas Nesrine,Stewart Lorna K.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference15 articles.

1. N. Abbas, Graph clustering: complexity, sequential and parallel algorithms, Ph.D. Thesis, Dept. of Computing Science, University of Alberta, 1995.

2. S.G. Akl, Parallel Computation: Models and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1997.

3. H. L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, Zs. Tuza, Rankings of graphs, WG 94, Herrsching, 1994, Lecture Notes in Computer Science, Vol. 903, Springer, Berlin, 1995, pp. 292–304.

4. Rankings of graphs;Bodlaender;SIAM J. Discrete Math.,1998

5. A. Brandstädt, Classes of bipartite graphs related to chordal graphs and domination of one color class by the other, Technical Report N/88/10, Friedrich-Schiller-Universität, Jena, 1988.

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

1. Spanning caterpillar in biconvex bipartite graphs;Discrete Applied Mathematics;2024-10

2. Radio labeling of biconvex split graphs;AKCE International Journal of Graphs and Combinatorics;2024-08-22

3. Path eccentricity of graphs;Discrete Applied Mathematics;2023-10

4. Upper Clique Transversals in Graphs;Graph-Theoretic Concepts in Computer Science;2023

5. Fair Allocation of Indivisible Items with Conflict Graphs;Algorithmica;2022-12-12