Arman Boyacı ; Tınaz Ekim ; Mordechai Shalom ; Shmuel Zaks - Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid

dmtcs:1350 - Discrete Mathematics & Theoretical Computer Science, June 12, 2017, Vol. 19 no. 1 -
Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a GridArticle

Authors: Arman Boyacı ; Tınaz Ekim ; Mordechai Shalom ORCID; Shmuel Zaks

    The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree ENPT, and in a Grid (ENPG). It was shown that ENPG contains an infinite hierarchy of subclasses that are obtained by restricting the number of bends in the paths. Motivated by this result, in this work we focus on one bend {ENPG} graphs. We show that one bend ENPG graphs are properly included in two bend ENPG graphs. We also show that trees and cycles are one bend ENPG graphs, and characterize the split graphs and co-bipartite graphs that are one bend ENPG. We prove that the recognition problem of one bend ENPG split graphs is NP-complete even in a very restricted subfamily of split graphs. Last we provide a linear time recognition algorithm for one bend ENPG co-bipartite graphs.

    Volume: Vol. 19 no. 1
    Section: Graph Theory
    Published on: June 12, 2017
    Accepted on: May 5, 2017
    Submitted on: June 12, 2017
    Keywords: Computer Science - Discrete Mathematics,Mathematics - Combinatorics
      Source : OpenAIRE Graph
    • Seçmeli Çizge Boyama Problemi; Funder: Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Code: 111M303

    Consultation statistics

    This page has been seen 565 times.
    This article's PDF has been downloaded 405 times.