maximum degree
Acyclic Coloring of Graphs of Maximum Degree $\Delta$
... of maximum degree ∆ can be acyclically colored in at most 9 ...of maximum degree 3 satisfies a(G) ≤ 4 and any graph of maximum degree 4 satisfies a(G) ≤ ...
9
Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough
... of maximum degree ∆ in ∆ 2 + 1 ...of maximum degree 3 [Gr¨ u73], and that there exists a graph G of maximum degree 3 for which any acyclic coloring requires 4 colors (a trivial ...
10
Overlaying a hypergraph with a graph with bounded maximum degree
... for this particular family in the aforementioned context of structural biology. However, this problem was previously studied by several communities in other domains, for example, in the design of vacuum systems [DK95], ...
5
Overlaying a hypergraph with a graph with bounded maximum degree
... Inria, Universit´ e Cˆ ote d’Azur, France 3 Universit´ e de Lyon, France Abstract. Let G and H be respectively a graph and a hypergraph de- fined on a same set of vertices, and let F be a fixed graph. We say that G F ...
13
Oriented cliques and colorings of graphs with low maximum degree
... bounded degree graphs, Kostochka et ...with maximum degree ∆ have oriented chromatic number at most 2∆ 2 2 ∆ ...with maximum degree ∆ and oriented chromatic number at least 2 ∆ / 2 ...
14
Overlaying a hypergraph with a graph with bounded maximum degree
... Let H be a hypergraph. Two hyperedges are adjacent if their intersection has size at least 2. A hypergraph is neat if any two distinct hyperedges intersect in at most one vertex. In other words, a hypergraph is neat if ...
24
The Maximum Degree of a Random Delaunay Triangulation in a Smooth Convex
... 1 Inria, 23 avenue d’Italie, 75013 Paris 2 Inria, 2004 route des Lucioles - BP 93, 06902 Sophia Antipolis Abstract. We give a new polylogarithmic bound on the maximum degree of a random Delaunay ...
3
Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof
... Planar graphs with maximum degree ∆ ≥ 9 are (∆ + 1)-edge-choosable – a short proof 5 Let us first show that H is a forest. Suppose by way of contradiction that H has cycle C. Then C is even because H is ...
9
An Empirical Study of the Maximum Degree of Undersampling in Compressed Sensing for T2*-weighted MRI
... the degree of acceleration applicable to a given acquisition scenario is still lacking today, leading in practice to a trial- and-error approach in the selection of the appropriate undersampling ...the ...
32
en fr Fractional chromatic number, maximum degree and girth Nombre chromatique fractionnaire, degré maximum et maille
... the maximum degree ∆(·) as an additional parameter, since on one hand ∆(G) is an easy lower bound on the independence number of a triangle-free graph G, and on the other hand graphs with smaller ...
26
Maximum degree in minor-closed classes of graphs
... whose maximum degree is too large (a bad graph), and let v be a vertex with large ...the degree of v: the lemmas in Section 3 tell us all possible 2-connected components that can occur, which ...
25
Total colouring of plane graphs with maximum degree nine
... This notion was independently introduced by Behzad [3] in his doctoral thesis and Vizing [15]. It is now a prominent notion in graph coloring, to which a whole book is devoted [17]. Both Behzad and Vizing made the ...
26
Choosability of bipartite graphs with maximum degree $Delta$
... Unité de recherche INRIA Sophia Antipolis 2004, route des Lucioles - BP 93 - 06902 Sophia Antipolis Cedex France Unité de recherche INRIA Lorraine : LORIA, Technopôle de Nancy-Brabois - [r] ...
19
Lower bounding the boundary of a graph in terms of its maximum or minimum degree
... mum degree δ n := 3 n−1 and maximum degree ∆ n := 3 n +n−1 with |B(G n )| = ...minimum degree implied by Theorem 1 is essentially best possible, which answers a question of Hasegawa and Saito ...
5
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree
... Abstract A proper vertex colouring of a graph G is 2-frugal (resp. linear) if the graph induced by the vertices of any two colour classes is of maximum degree 2 (resp. is a forest of paths). A graph G is ...
17
Linear and 2-frugal choosability of graphs of small maximum average degree
... p ∆(G) 1+1/p ). In addition, they show that this upper bound is tight up to within a constant factor by showing graphs G such that Φ p (G) ≥ 2p 1 ∆(G) 1+1/p . Yuster [4] mixed the notions of 2-frugality and acyclicity, ...
25
Online Maximum k-Coverage
... 3 Maximum k-vertex coverage In this section we deal with the online maximum k-vertex coverage problem. Note that there exists a trivial 1 2 -competitive ratio for this problem. In fact, consider selecting ...
20
Decentralized maximum flow algorithms
... and upon control messages received from adjacent nodes, to achieve a flow f.. for which the total flow is maximum.[r] ...
31
Computed maximum snow loads
... / La version de cette publication peut être l’une des suivantes : la version prépublication de l’auteur, la version acceptée du manuscrit ou la version de l’éditeur. Access and use of [r] ...
7
On the Solution of Equations of Degree
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...
30