Results 41 to 50 of about 586,356 (320)
Foremost Walks and Paths in Interval Temporal Graphs
Algorithms, 2022 The min-wait foremost, min-hop foremost and min-cost foremost paths and walks problems in interval temporal graphs are considered. We prove that finding min-wait foremost and min-cost foremost walks and paths in interval temporal graphs is NP-hard.
Anuj Jain, Sartaj Sahni
doaj +1 more source
Bounded Representations of Interval and Proper Interval Graphs
, 2013 Klavik et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition for each vertex
D.G. Corneil +11 more
core +1 more source
Recognizing edge clique graphs among interval graphs and probe interval graphs
Applied Mathematics Letters, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kong, Jing, Wu, Yaokun
openaire +1 more source
Interval edge-coloring: A model of curriculum scheduling
AKCE International Journal of Graphs and Combinatorics, 2020 Considering the appointments that teachers plan to teach some courses for specific classes, the problem is to schedule the curriculum such that the time for each teacher is consecutive.
Zehui Shao +4 more
doaj +1 more source
Completion of the mixed unit interval graphs hierarchy
, 2017 We describe the missing class of the hierarchy of mixed unit interval graphs, generated by the intersection graphs of closed, open and one type of half-open intervals of the real line.
Kratochvíl, Jan, Talon, Alexandre
core +2 more sources
Interval Count of Interval Graphs
Cadernos do IME - Série Informática, 2022 The interval count problem is that of determining the smallest number of distinct interval lengths that is sufficient to represent an interval model of a given interval graph. The class of interval graphs is well known, with several applications. This article briefly summarizes my doctorate thesis done on the subject with supervision of Prof.
openaire +1 more source
Interval Incidence Coloring of Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and ...
Małafiejska Anna, Małafiejski Michał
doaj +1 more source
Tractabilities and Intractabilities on Geometric Intersection Graphs
Algorithms, 2013 A graph is said to be an intersection graph if there is a set of objects such that each vertex corresponds to an object and two vertices are adjacent if and only if the corresponding objects have a nonempty intersection.
Ryuhei Uehara
doaj +1 more source
Total Roman domination for proper interval graphs
Electronic Journal of Graph Theory and Applications, 2020 A function f:V → {0,1,2} is a total Roman dominating function (TRDF) on a graph G=(V,E) if for every vertex v ∈ V with f(v) = 0 there is a vertex u adjacent to v with f(u) = 2 and for every vertex v ∈ V with f(v) > 0 there exists a vertex u ∈ NG(v ...
Abolfazl Poureidi
doaj +1 more source