Results 11 to 20 of about 3,787 (214)
Discussiones Mathematicae Graph Theory, 2022 We introduce a new notion of circular colourings for digraphs. The idea of this quantity, called star dichromatic number χ→*\vec \chi * (D) of a digraph D, is to allow a finer subdivision of digraphs with the same dichromatic number into such which are ...
Hochstättler Winfried, Steiner Raphael
doaj +1 more source
Density of universal classes of series-parallel graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A class of graphs $\mathcal{C}$ ordered by the homomorphism relation is universal if every countable partial order can be embedded in $\mathcal{C}$. It was shown in [ZH] that the class $\mathcal{C_k}$ of $k$-colorable graphs, for any fixed $k≥3$, induces
Jaroslav Nešetřil, Yared Nigussie
doaj +1 more source
List circular backbone colouring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj +1 more source
The circular chromatic number of hypergraphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard C. Brewster +2 more
openaire +1 more source
Falling film hydrodynamics of horizontal egg-shaped tube under column flow [PDF]
AIP AdvancesEgg-shaped tubes show strong potential for application in horizontal falling-film heat exchangers owing to their ability to enhance fluid distribution and film stability.
Donghui Li +9 more
doaj +1 more source
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
European Journal of Combinatorics, 1998 This paper studies the circular (or star) chromatic numbers and fractional chromatic numbers of distance graphs \(G(Z, D)\) for various sets \(D\) (being the graph with vertex set a subset of the integers, and two vertices \(x\), \(y\) being adjacent iff \(| x-y|\in D\)). Various specific cases are calculated, including all cases when \(| D|= 2\).
Chang, Gerard J. +2 more
openaire +2 more sources
Generalized Fractional and Circular Total Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let P and Q be additive and hereditary graph properties, r, s ∈ N, r ≥ s, and [ℤr]s be the set of all s-element subsets of ℤr. An (r, s)-fractional (P,Q)-total coloring of G is an assignment h : V (G) ∪ E(G) → [ℤr]s such that for each i ∈ ℤr the ...
Kemnitz Arnfried +4 more
doaj +1 more source
Fractional (P,Q)-Total List Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2013 Let r, s ∈ N, r ≥ s, and P and Q be two additive and hereditary graph properties. A (P,Q)-total (r, s)-coloring of a graph G = (V,E) is a coloring of the vertices and edges of G by s-element subsets of Zr such that for each color i, 0 ≤ i ≤ r − 1, the ...
Kemnitz Arnfried +2 more
doaj +1 more source
Design of beam optics for the future circular collider e^{+}e^{-} collider rings
Physical Review Accelerators and Beams, 2016 A beam optics scheme has been designed for the future circular collider-e^{+}e^{-} (FCC-ee). The main characteristics of the design are: beam energy 45 to 175 GeV, 100 km circumference with two interaction points (IPs) per ring, horizontal crossing angle
K. Oide +26 more
doaj +1 more source
Circular game chromatic number of graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wensong Lin, Xuding Zhu
openaire +2 more sources