Cruz, E. P.; Groshaus, M.; Guedes, A. L. P.; Puppo, J. P. Biclique graphs of interval bigraphs. (English) Zbl 1440.05132 Discrete Appl. Math. 281, 134-143 (2020). MSC: 05C38 PDF BibTeX XML Cite \textit{E. P. Cruz} et al., Discrete Appl. Math. 281, 134--143 (2020; Zbl 1440.05132) Full Text: DOI OpenURL
Mengel, Stefan Lower bounds on the mim-width of some graph classes. (English) Zbl 1395.05172 Discrete Appl. Math. 248, 28-32 (2018). MSC: 05C85 PDF BibTeX XML Cite \textit{S. Mengel}, Discrete Appl. Math. 248, 28--32 (2018; Zbl 1395.05172) Full Text: DOI arXiv OpenURL
Kang, Dong Yeap; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne A width parameter useful for chordal and co-comparability graphs. (English) Zbl 1380.05151 Theor. Comput. Sci. 704, 1-17 (2017). MSC: 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{D. Y. Kang} et al., Theor. Comput. Sci. 704, 1--17 (2017; Zbl 1380.05151) Full Text: DOI arXiv OpenURL
Stacho, Juraj 3-colouring AT-free graphs in polynomial time. (English) Zbl 1257.68075 Algorithmica 64, No. 3, 384-399 (2012). MSC: 68Q17 68R10 05C85 05C15 PDF BibTeX XML Cite \textit{J. Stacho}, Algorithmica 64, No. 3, 384--399 (2012; Zbl 1257.68075) Full Text: DOI OpenURL
Calamoneri, Tiziana; Caminiti, Saverio; Petreschi, Rossella; Olariu, Stephan On the \(L(h, k)\)-labeling of co-comparability graphs and circular-arc graphs. (English) Zbl 1167.05043 Networks 53, No. 1, 27-34 (2009). MSC: 05C78 PDF BibTeX XML Cite \textit{T. Calamoneri} et al., Networks 53, No. 1, 27--34 (2009; Zbl 1167.05043) Full Text: DOI OpenURL
Calamoneri, Tiziana; Caminiti, Saverio; Olariu, Stephan; Petreschi, Rossella On the \(L(h,k)\)-labeling of co-comparability graphs. (English) Zbl 1176.05071 Chen, Bo (ed.) et al., Combinatorics, algorithms, probabilistic and experimental methodologies. First international symposium, ESCAPE 2007, Hangzhou, China, April 7–9, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-74449-8/pbk). Lecture Notes in Computer Science 4614, 116-127 (2007). MSC: 05C78 PDF BibTeX XML Cite \textit{T. Calamoneri} et al., Lect. Notes Comput. Sci. 4614, 116--127 (2007; Zbl 1176.05071) Full Text: DOI OpenURL
Meister, Daniel Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. (English) Zbl 1077.68076 Discrete Appl. Math. 146, No. 3, 193-218 (2005). MSC: 68R10 05C85 05C78 PDF BibTeX XML Cite \textit{D. Meister}, Discrete Appl. Math. 146, No. 3, 193--218 (2005; Zbl 1077.68076) Full Text: DOI OpenURL
Abbas, Moncef; Pirlot, Marc; Vincke, Philippe Preference structures and co-comparability graphs. (English) Zbl 0847.90004 J. Multi-Criteria Decis. Anal. 5, No. 2, 81-98 (1996). MSC: 91B08 05C99 PDF BibTeX XML Cite \textit{M. Abbas} et al., J. Multi-Criteria Decis. Anal. 5, No. 2, 81--98 (1996; Zbl 0847.90004) Full Text: DOI OpenURL
Kratochvíl, Jan \(k\)-Ramsey classes and dimensions of graphs. (English) Zbl 0842.05063 Commentat. Math. Univ. Carol. 36, No. 2, 263-268 (1995). Reviewer: P.Braß (Greifswald) MSC: 05C55 05D10 PDF BibTeX XML Cite \textit{J. Kratochvíl}, Commentat. Math. Univ. Carol. 36, No. 2, 263--268 (1995; Zbl 0842.05063) Full Text: EuDML OpenURL
Helmbold, David; Mayr, Ernst Applications of parallel scheduling to perfect graphs. (English) Zbl 0643.68087 Graph-theoretic concepts in computer science, Proc. Int. Workshop, Bernried/FRG 1986, Lect. Notes Comput. Sci. 246, 188-203 (1987). MSC: 68R10 68M20 68Q25 68N99 PDF BibTeX XML OpenURL