The complexity of comparability graph recognition and coloring-Reference-Cited by-同舟云学术

The complexity of comparability graph recognition and coloring

Published:1977-09 Issue:3 Volume:18 Page:199-208
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Golumbic M. C.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

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

Reference11 articles.

1. Berge, C.: Graphs and Hypergraphs, Chapter 16. Amsterdam: North-Holland 1973.

2. Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. J. ACM19, 400–410 (1972).

3. Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hung.18, 25–66 (1967).

4. Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph. SIAM J. Comp.1, 180–187 (1972).

5. Ghouila-Houri, A.: Caractérisation des graphes nonorientés dont on peut orienter les arêtes de manière à obtenir le graphe d'une relation d'ordre. C. R. Acad. Sci. Paris254, 1370–1371 (1962).

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

1. Gallai‐like characterization of strong cocomparability graphs;Journal of Graph Theory;2024-05-06

2. Comparability digraphs: An analogue of comparability graphs;Discrete Mathematics;2024-03

3. Human-verifiable proofs in the theory of word-representable graphs;RAIRO - Theoretical Informatics and Applications;2024

4. An analogue of quasi-transitivity for edge-coloured graphs;Discussiones Mathematicae Graph Theory;2023

5. Independent Set Under a Change Constraint from an Initial Solution;Lecture Notes in Computer Science;2023