Two remarks on circular arc graphs-Reference-Cited by-同舟云学术

Two remarks on circular arc graphs

Published:1997-03 Issue:1 Volume:13 Page:65-72
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Hell Pavol,Huang Jing

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01202237.pdf

Reference18 articles.

1. Apostolico, A., Hambrusch, S.E.: Finding maximum cliques on circular arc graphs. Information Processing Letters26, 209?215 (1987)

2. Bhattacharya, B., Kaller, D.M.: AnO(m+nlogn) algorithm for the maximum clique problem in circular arc graphs. Simon Fraser University CSS/LCCR TR 94-26

3. Bhattacharya, B., Hell, P., Huang, J.: A linear algorithm for maximum cliques in proper circular arc graphs. SIAM J. on Discrete Math (in press)

4. Eschen, E.M., Spinrad, J.:O(n 2) recognition and isomorphism algorithms for circular-arc graphs. Proc 4th Ann SODA, pp. 128?137

5. Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs, submitted to Combinatorica

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

1. Recognizing simple-triangle graphs by restricted 2-chain subgraph cover;Discrete Applied Mathematics;2020-05

2. Non-edge orientation and vertex ordering characterizations of some classes of bigraphs;Discrete Applied Mathematics;2018-08

3. Lexicographic Orientation Algorithms;Springer Monographs in Mathematics;2018

4. Graphs and digraphs represented by intervals and circular arcs;Discrete Applied Mathematics;2017-09

5. Ferrers dimension of grid intersection graphs;Discrete Applied Mathematics;2017-01