Finding Intersection Models of Weakly Chordal Graphs

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern. Finding Intersection Models of Weakly Chordal Graphs. In Fedor V. Fomin, editor, Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers. Volume 4271 of Lecture Notes in Computer Science, pages 241-255, Springer, 2006. [doi]

@inproceedings{GolumbicLS06,
  title = {Finding Intersection Models of Weakly Chordal Graphs},
  author = {Martin Charles Golumbic and Marina Lipshteyn and Michal Stern},
  year = {2006},
  doi = {10.1007/11917496_22},
  url = {http://dx.doi.org/10.1007/11917496_22},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GolumbicLS06},
  cites = {0},
  citedby = {0},
  pages = {241-255},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
  editor = {Fedor V. Fomin},
  volume = {4271},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-48381-0},
}