Registro:

Referencias:

• Bang-Jensen, J., Gutin, G., Theory, algorithms and applications (2001) Digraphs, , Springer Monographs in Mathematics Springer-Verlag London Ltd. London
• Bhowmick, D., Chandran, L.S., Boxicity of circular arc graphs (2011) Graphs Combin., 27 (6), pp. 769-783
• Booth, K.S., Lueker, G.S., Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (1976) J. Comput. Syst. Sci., 13 (3), pp. 335-379. , (Working Papers presented at the ACM-SIGACT Symposium on the Theory of Computing, Albuquerque, N. M., 1975)
• Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P., Simple linear time recognition of unit interval graphs (1995) Inform. Process. Lett., 55 (2), pp. 99-104
• Crespelle, C., Fully dynamic representations of interval graphs (2010) Graph-Theoretic Concepts in Computer Science, 5911, pp. 77-87. , Lecture Notes in Comput. Sci. Springer Berlin
• Curtis, A.R., (2007) Linear-time Graph Algorithms for Chordal Comparability Graphs and Helly Circular Arc Graphs, , Master's Thesis, Colorado State University
• Deng, X., Hell, P., Huang, J., Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs (1996) SIAM J. Comput., 25 (2), pp. 390-403
• Deogun, J.S., Gopalakrishnan, K., Consecutive retrieval property - Revisited (1999) Inform. Process. Lett., 69 (1), pp. 15-20
• Durán, G., Lin, M.C., Clique graphs of Helly circular-arc graphs (2001) Ars Combin., 60, pp. 255-271
• Fishburn, P.C., Interval Orders and Interval Graphs (1985) Wiley-Interscience Series in Discrete Mathematics, , John Wiley & Sons Ltd. Chichester (A study of partially ordered sets, A Wiley-Interscience Publication)
• Fulkerson, D.R., Gross, O.A., Incidence matrices and interval graphs (1965) Pacific J. Math., 15, pp. 835-855
• Gardi, F., The Roberts characterization of proper and unit interval graphs (2007) Discrete Math., 307 (22), pp. 2906-2908
• Gavril, F., Algorithms on circular-arc graphs (1974) Networks, 4, pp. 357-369
• Gilmore, P.C., Hoffman, A.J., A characterization of comparability graphs and of interval graphs (1964) Canad. J. Math., 16, pp. 539-548
• Golumbic, M.C., (2004) Algorithmic Graph Theory and Perfect Graphs, 57. , 2nd ed. Annals of Discrete Mathematics Elsevier Science B.V Amsterdam
• Habib, M., McConnell, R., Paul, C., Viennot, L., Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing (2000) Theoret. Comput. Sci., 234 (12), pp. 59-84
• Hedman, B., Clique graphs of time graphs (1984) J. Combin. Theory Ser. B, 37 (3), pp. 270-278
• Hell, P., Huang, J., Interval bigraphs and circular arc graphs (2004) J. Graph Theory, 46 (4), pp. 313-327
• Hell, P., Huang, J., Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (1995) J. Graph Theory, 20 (3), pp. 361-374
• Hell, P., Shamir, R., Sharan, R., A fully dynamic algorithm for recognizing and representing proper interval graphs (2001) SIAM J. Comput., 31 (1), pp. 289-305. , (electronic)
• Hsu, W.-L., McConnell, R.M., PC trees and circular-ones arrangements (2003) Computing and Combinatorics (Guilin, 2001), 296 (1), pp. 99-116. , Theoret. Comput. Sci
• Huang, J., On the structure of local tournaments (1995) J. Combin. Theory Ser. B, 63 (2), pp. 200-221
• Huang, J., (1992) Tournament-like Oriented Graphs, , Ph.D. Thesis, Simon Fraser University
• Joeris, B., Lin, M., McConnell, R., Spinrad, J., Szwarcfiter, J., Linear-time recognition of Helly circular-arc models and graphs (2011) Algorithmica, 59, pp. 215-239
• Kaplan, H., Nussbaum, Y., A simpler linear-time recognition of circular-arc graphs (2011) Algorithmica, 61 (3), pp. 694-737
• Kaplan, H., Nussbaum, Y., Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs (2009) Discrete Appl. Math., 157 (15), pp. 3216-3230
• Korte, N., Möhring, R.H., An incremental linear-time algorithm for recognizing interval graphs (1989) SIAM J. Comput., 18 (1), pp. 68-81
• Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P., Certifying algorithms for recognizing interval graphs and permutation graphs (2006) SIAM J. Comput., 36 (2), pp. 326-353. , (electronic)
• Lekkerkerker, C.G., Boland, J.C., Representation of a finite graph by a set of intervals on the real line (1962) Fund. Math., 51, pp. 45-64
• Lin, M.C., McConnell, R.M., Soulignac, F.J., Szwarcfiter, J.L., On cliques of Helly circular-arc graphs (2008) The IV Latin-American Algorithms, Graphs, and Optimization Symposium, 30, pp. 117-122. , Electron. Notes Discrete Math. Elsevier Sci. B. V Amsterdam
• Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L., The clique operator on circular-arc graphs (2010) Discrete Appl. Math., 158 (12), pp. 1259-1267
• Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L., Proper Helly circular-arc graphs (2007) Graph-Theoretic Concepts in Computer Science, 4769, pp. 248-257. , A. Brandstädt, D. Kratsch, H. Müller, Lecture Notes in Comput. Sci. Springer Berlin
• Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L., A simple linear time algorithm for the isomorphism problem on proper circular-arc graphs (2008) Algorithm Theory - SWAT 2008, 5124, pp. 355-366. , Lecture Notes in Comput. Sci. Springer Berlin
• Lin, M.C., Soulignac, F.J., Szwarcfiter, J.L., Short models for unit interval graphs (2009) LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, 35, pp. 247-255. , Electron. Notes Discrete Math. Elsevier Sci. B. V Amsterdam
• Lin, M.C., Szwarcfiter, J.L., Characterizations and recognition of circular-arc graphs and subclasses: A survey (2009) Discrete Math., 309 (18), pp. 5618-5635
• Lin, M.C., Szwarcfiter, J.L., Unit circular-arc graph representations and feasible circulations (2008) SIAM J. Discrete Math., 22 (1), pp. 409-423
• Lin, M.C., Szwarcfiter, J.L., Characterizations and linear time recognition of Helly circular-arc graphs (2006) Computing and Combinatorics, 4112, pp. 73-82. , D.Z. Chen, D.T. Lee, Lecture Notes in Comput. Sci. Springer Berlin
• Looges, P.J., Olariu, S., Greedy recognition and coloring algorithms for indifference graphs (1992) Computer Science and Operations Research (Williamsburg, VA, 1992), pp. 127-137. , Pergamon Oxford
• McConnell, R.M., Linear-time recognition of circular-arc graphs (2003) Algorithmica, 37 (2), pp. 93-147
• McKee, T.A., Restricted circular-arc graphs and clique cycles (2003) Discrete Math., 263 (13), pp. 221-231
• Mitas, J., Minimal representation of semiorders with intervals of same length (1994) Orders, Algorithms, and Applications (Lyon, 1994), 831, pp. 162-175. , V. Bouchitté, M. Morvan, Lecture Notes in Comput. Sci. Springer Berlin
• Müller, H., Recognizing interval digraphs and interval bigraphs in polynomial time (1997) Discrete Appl. Math., 78 (13), pp. 189-205
• Nussbaum, Y., From a circular-arc model to a proper circular-arc model (2008) Graph-Theoretic Concepts in Computer Science, 5344, pp. 324-335. , H. Broersma, T. Erlebach, T. Friedetzky, D. Paulusma, Lecture Notes in Computer Science Springer Berlin, Heidelberg
• Roberts, F.S., Indifference graphs (1969) Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968), pp. 139-146. , Academic Press New York
• Roberts, F.S., On the boxicity and cubicity of a graph (1969) Recent Progress in Combinatorics (Proc. Third Waterloo Conf. on Combinatorics, 1968), pp. 301-310. , Academic Press New York
• Skrien, D.J., A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs (1982) J. Graph Theory, 6 (3), pp. 309-316
• Soulignac, F.J., (2010) On Proper and Helly Circular-arc Graphs, , Ph.D. Thesis, Universidad de Buenos Aires, March
• Tucker, A., Structure theorems for some circular-arc graphs (1974) Discrete Math., 7, pp. 167-195
• Tucker, A., Coloring a family of circular arcs (1975) SIAM J. Appl. Math., 29 (3), pp. 493-502

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------