Table of Contents
Journal of Discrete Mathematics
Volume 2014 (2014), Article ID 143809, 7 pages
http://dx.doi.org/10.1155/2014/143809
Research Article

A Characterization of 2-Tree Proper Interval 3-Graphs

1Department of Mathematics and Statistics, Utah State University, Logan, UT 84322, USA
2Mathematics Department, Western Oregon University, Monmouth, OR 97361, USA

Received 30 September 2013; Revised 12 December 2013; Accepted 15 December 2013; Published 23 February 2014

Academic Editor: Hong J. Lai

Copyright © 2014 David E. Brown and Breeann M. Flesch. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. E. Brown, Variations on interval graphs [Ph.D. thesis], University of Colorado, Denver, Colo, USA, 2004.
  2. D. E. Brown, S. C. Flink, and J. R. Lundgren, “Interval k-graphs,” in Proceedings of the 33rd Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 156, pp. 5–16, Boca Raton, Fla, USA, 2002.
  3. F. Harary, J. A. Kabell, and F. R. McMorris, “Bipartite intersection graphs,” Commentationes Mathematicae Universitatis Carolinae, vol. 23, no. 4, pp. 739–745, 1982. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. P. Hell and J. Huang, “Interval bigraphs and circular arc graphs,” Journal of Graph Theory, vol. 46, no. 4, pp. 313–327, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. P. Hell and J. Huang, “Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs,” SIAM Journal on Discrete Mathematics, vol. 18, no. 3, pp. 554–570, 2004/05. View at Publisher · View at Google Scholar · View at MathSciNet
  6. H. Müller, “Recognizing interval digraphs and interval bigraphs in polynomial time,” Discrete Applied Mathematics, vol. 78, no. 1–3, pp. 189–205, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. S. Das, A. B. Roy, M. Sen, and D. B. West, “Interval digraphs: an analogue of interval graphs,” Journal of Graph Theory, vol. 13, no. 2, pp. 189–202, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. H. Alpert, C. Koch, and J. D. Laison, “Obstacle numbers of graphs,” Discrete & Computational Geometry, vol. 44, no. 1, pp. 223–244, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. S. Ghosh, M. Podder, and M. K. Sen, “Adjacency matrices of probe interval graphs,” Discrete Applied Mathematics, vol. 158, no. 18, pp. 2004–2013, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. D. E. Brown, J. R. Lundgren, and C. Miller, “Variations on interval graphs,” in Proceedings of the 32nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 149, pp. 77–95, (Baton Rouge, La, USA), 2001. View at MathSciNet
  11. B. Flesch and J. R. Lundgren, “A characterization of k-trees that are interval p-graphs,” The Australasian Journal of Combinatorics, vol. 49, pp. 227–237, 2011. View at Google Scholar · View at MathSciNet
  12. D. E. Brown and J. R. Lundgren, “Characterizations for unit interval bigraphs,” Congressus Numerantium, vol. 206, pp. 5–17, 2010. View at Google Scholar
  13. D. E. Brown and B. M. Flesch, “On cocomparability proper interval 2- and 3-graphs,” manuscript, 2014.
  14. M. Borowiecki and H. P. Patil, “On colouring and the chromatic polynomial of k-trees,” Journal of Combinatorics, Information & System Sciences, vol. 11, no. 2–4, pp. 124–128, 1986. View at Google Scholar · View at MathSciNet
  15. R. B. Hayward, “Weakly triangulated graphs,” Journal of Combinatorial Theory B, vol. 39, no. 3, pp. 200–209, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. F. S. Roberts, “Indifference graphs,” in Proof Techniques in Graph Theory, F. Harary, Ed., Academic Press, New York, NY, USA, 1969. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. M. Sen and B. K. Sanyal, “Indifference digraphs: a generalization of indifference graphs and semiorders,” SIAM Journal on Discrete Mathematics, vol. 7, no. 2, pp. 157–165, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. M. C. Golumbic and M. Lipshteyn, “On the hierarchy of interval, probe and tolerance graphs,” in Proceedings of the 32nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 153, pp. 97–106, Baton Rouge, La, USA, 2001. View at MathSciNet