Results 41 to 50 of about 157,845 (305)

Interval edge-coloring: A model of curriculum scheduling

open access: yesAKCE 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

On interval representations of graphs

open access: yesDiscrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braga de Queiroz, Aquiles   +2 more
openaire   +1 more source

Simultaneous Interval Graphs [PDF]

open access: yes, 2010
In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two interval graphs G_1 and G_2, sharing some vertices I (and the corresponding induced edges), are said to be ...
Krishnam Raju Jampani, Anna Lubiw
openaire   +2 more sources

Signed interval graphs and bigraphs: A generalization of interval graphs and bigraphs

open access: yesCoRR, 2022
In this paper, we define and characterize signed interval graphs and bigraphs introducing the concept of negative interval. Also we have shown that these classes of graphs are respectively a generalization of well known classes of interval graphs and interval bigraphs.
Ashok Kumar Das, Indrajit Paul
openaire   +2 more sources

Testing hereditary properties of nonexpanding bounded-degree graphs [PDF]

open access: yes, 2007
We study graph properties that are testable for bounded-degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It
Christian Sohler   +5 more
core   +1 more source

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Uniquely orderable interval graphs

open access: yes, 2022
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders.
Fiori-Carones, Marta, Marcone, Alberto
core   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

Interval Incidence Coloring of Subcubic Graphs

open access: yesDiscussiones 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

Total Roman domination for proper interval graphs

open access: yesElectronic 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

Home - About - Disclaimer - Privacy