Complexity classification of the edge coloring problem for a family of graph classes

2017 ◽  
Vol 27 (2) ◽  
Author(s):  
Dmitriy S. Malyshev
Keyword(s):  
Edge Coloring ◽  
Complete Classification ◽  
Chromatic Index ◽  
Forbidden Subgraphs ◽  
Coloring Problem ◽  
Graph Classes ◽  
Complexity Classification ◽  
Index Problem

AbstractA class of graphs is called monotone if it is closed under deletion of vertices and edges. Any such class may be defined in terms of forbidden subgraphs. The chromatic index of a graph is the smallest number of colors required for its edge-coloring such that any two adjacent edges have different colors. We obtain a complete classification of the complexity of the chromatic index problem for all monotone classes defined in terms of forbidden subgraphs having at most 6 edges or at most 7 vertices.

scholarly journals THE PROPORTIONAL COLORING PROBLEM: OPTIMIZING BUFFERS IN RADIO MESH NETWORKS

2012 ◽  
Vol 04 (03) ◽  
pp. 1250028 ◽  
Author(s):  
FLORIAN HUC ◽  
CLÁUDIA LINHARES SALES ◽  
HERVÉ RIVANO
Keyword(s):  
Mesh Networks ◽  
Edge Coloring ◽  
Weighted Graph ◽  
Minimum Cost ◽  
Upper Bounds ◽  
Weighted Graphs ◽  
Chromatic Index ◽  
Lower And Upper Bounds ◽  
Coloring Problem ◽  
Wireless Mesh

In this paper, we consider a new edge coloring problem to model call scheduling optimization issues in wireless mesh networks: the proportional coloring. It consists in finding a minimum cost edge coloring of a graph which preserves the proportion given by the weights associated to each of its edges. We show that deciding if a weighted graph admits a proportional coloring is pseudo-polynomial while determining its proportional chromatic index is NP-hard. We then give lower and upper bounds for this parameter that can be computed in pseudo-polynomial time. We finally identify a class of graphs and a class of weighted graphs for which the proportional chromatic index can be exactly determined.

scholarly journals Multiplicative automatic sequences

2021 ◽  
Author(s):  
Jakub Konieczny ◽  
Mariusz Lemańczyk ◽  
Clemens Müllner
Keyword(s):  
Complete Classification ◽  
Automatic Sequences ◽  
Complex Valued

AbstractWe obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.

scholarly journals Characteristic cohomology and observables in higher spin gravity

2020 ◽  
Vol 2020 (12) ◽  
Author(s):  
Alexey Sharapov ◽  
Evgeny Skvortsov
Keyword(s):  
Higher Spin Gravity ◽  
Complete Classification ◽  
Gravity Models ◽  
Simons Theory ◽  
Surface Charges ◽  
Higher Spin ◽  
Dynamical Invariants ◽  
Chern Simons ◽  
Conserved Currents

Abstract We give a complete classification of dynamical invariants in 3d and 4d Higher Spin Gravity models, with some comments on arbitrary d. These include holographic correlation functions, interaction vertices, on-shell actions, conserved currents, surface charges, and some others. Surprisingly, there are a good many conserved p-form currents with various p. The last fact, being in tension with ‘no nontrivial conserved currents in quantum gravity’ and similar statements, gives an indication of hidden integrability of the models. Our results rely on a systematic computation of Hochschild, cyclic, and Chevalley-Eilenberg cohomology for the corresponding higher spin algebras. A new invariant in Chern-Simons theory with the Weyl algebra as gauge algebra is also presented.

scholarly journals Nil-clean quadratic elements

2017 ◽  
Vol 16 (10) ◽  
pp. 1750197 ◽  
Author(s):  
Janez Šter
Keyword(s):  
Complete Classification ◽  
Strong Condition ◽  
Clean Rings

We provide a strong condition holding for nil-clean quadratic elements in any ring. In particular, our result implies that every nil-clean involution in a ring is unipotent. As a consequence, we give a complete classification of weakly nil-clean rings introduced recently in [Breaz, Danchev and Zhou, Rings in which every element is either a sum or a difference of a nilpotent and an idempotent, J. Algebra Appl. 15 (2016) 1650148, doi: 10.1142/S0219498816501486].

Ricci inheritance collineations in Bianchi type II spacetime

2016 ◽  
Vol 31 (17) ◽  
pp. 1650102 ◽  
Author(s):  
Tahir Hussain ◽  
Sumaira Saleem Akhtar ◽  
Ashfaque H. Bokhari ◽  
Suhail Khan
Keyword(s):  
Lie Algebra ◽  
Ricci Tensor ◽  
Bianchi Type ◽  
Complete Classification ◽  
Type Ii

In this paper, we present a complete classification of Bianchi type II spacetime according to Ricci inheritance collineations (RICs). The RICs are classified considering cases when the Ricci tensor is both degenerate as well as non-degenerate. In case of non-degenerate Ricci tensor, it is found that Bianchi type II spacetime admits 4-, 5-, 6- or 7-dimensional Lie algebra of RICs. In the case when the Ricci tensor is degenerate, majority cases give rise to infinitely many RICs, while remaining cases admit finite RICs given by 4, 5 or 6.

Sign in / Sign up

Export Citation Format

Share Document