Results 31 to 40 of about 588,772 (275)
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
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
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
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
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
Interval total colorings of graphs
, 2003 A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color.
A Prouté +17 more
core +3 more sources
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
The niche graphs of interval orders
Discussiones Mathematicae Graph Theory, 2014 The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N+D(x) ∩ N+D(y) ≠ ∅ or N−D(x) ∩ N−D(y) ≠ ∅, where N+D(x) (resp.
Park Jeongmi, Sano Yoshio
doaj +1 more source
Mathematics, 2019 The independent number of a graph G is the cardinality of the maximum independent set of G, denoted by α ( G ) . The independent dominating number is the cardinality of the smallest independent set that dominates all vertices of G.
Mohammad Abudayah, Omar Alomari
doaj +1 more source