Research output per year
Research output per year
Steven Chaplick^{*}
Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree. Forbidden induced subgraph characterizations and linear time certifying recognition algorithms are given for intersection graphs of NC paths of a tree (and related subclasses). For intersection graphs of NC paths of a tree, the dominating set problem is shown to be solvable in linear time. Also, each such graph is shown to have a Hamiltonian cycle if and only if it is 2-connected, and to have a Hamiltonian path if and only if its block-cutpoint tree is a path.
Original language | English |
---|---|
Title of host publication | Graph-Theoretic Concepts in Computer Science. WG 2019 |
Editors | I. Sau, D. Thilikos |
Pages | 311-324 |
Number of pages | 14 |
DOIs | |
Publication status | Published - 2019 |
Externally published | Yes |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 11789 |
ISSN | 0302-9743 |
Research output: Contribution to journal › Article › Academic › peer-review