Search

Let $Z_2\times Z_2=\{0, \alpha, \beta, \alpha+\beta\}$. If $G$ is a bridgeless cubic graph, $F$ is a perfect matching of $G$ and $\overline{F}$ is the complementary 2-factor of $F$, then a no-where zero $Z_2\times Z_2$-flow $\theta$ of $G/\overline{F}$ is called non-conflicting with respect to $\overline{F}$, if $\overline{F}$ contains no edge $e=uv$, such that $u$ is incident to an edge with $\theta$-value $\alpha$ and $v$ is incident to an edge with $\theta$-value $\beta$. In this paper, we demonstrate the usefulness of non-conflicting flows by showing that if a cubic graph $G$ admits such a flow with respect to some perfect matching $F$, then $G$ admits a normal 6-edge-coloring. We use this observation in order to show that claw-free bridgeless cubic graphs, bridgeless cubic graphs possessing a 2-factor having at most two cycles admit a normal 6-edge-coloring. We demonstrate the usefulness of non-conflicting flows further by relating them to a recent conjecture of Thomassen about edge-disjoint perfect matchings in highly connected regular graphs. In the end of the paper, we construct infinitely many 2-edge-connected cubic graphs such that $G/\overline{F}$ does not admit a non-conflicting no-where zero $Z_2\times Z_2$-flow with respect to any perfect matching $F$., Comment: 19 pages, 9 figures

In this paper, we consider the maximum $k$-edge-colorable subgraph problem. In this problem we are given a graph $G$ and a positive integer $k$, the goal to take $k$ matchings of $G$ such that their union contains maximum number of edges. This problem is NP-hard in cubic graphs, and polynomial time solvable in bipartite graphs as we observe in our paper. We present two NP-hardness results for two versions of this problem where we have weights on edges or color constraints on vertices. In fact, we show that these versions are NP-hard already in bipartite graphs of maximum degree three. In order to achieve these results, we establish a connection between our problems and the problem of construction of special maximum matchings considered in the Master thesis of the author and defended back in 2003., Comment: 18 pages, 14 figures

For a graph $G$ define the parameters $\ell(G)$ and $L(G)$ as the minimum and maximum value of $\nu(G\backslash F)$, where $F$ is a maximum matching of $G$ and $\nu(G)$ is the number of edges in it. In this paper, we show that there is a small constant $c>0$, such that the following decision problem is NP-complete: given a graph $G$ and $k\leq \frac{|V|}{2}$, check whether there is a maximum matching $F$ in $G$, such that $|\nu(G\backslash F)-k|\leq c\cdot |V|$. Note that when $c=1$, this problem is polynomial time solvable as we observe in the paper. Since in any graph $G$, we have $L(G)\leq 2\ell(G)$, any polynomial time algorithm constructing a maximum matching of a graph is a 2-approximation algorithm for $\ell(G)$ and $\frac{1}{2}$-approximation algorithm for $L(G)$. We complement these observations by presenting two inapproximability results for $\ell(G)$ and $L(G)$., Comment: 14 pages, 9 figures. arXiv admin note: substantial text overlap with arXiv:2409.15388

In this paper, we consider some general properties of block graphs as well as the equitable coloring problem in this class of graphs. In the first part we establish the relation between two structural parameters for general block graphs. We also give complete characterization of block graphs with given value of parameter $\alpha_{\min}$. In the next part of the paper we confirm the hypothesis for some subclass of GLS block graphs in which the problem of EQUITABLE COLORING is unlikely to be polynomial time solvable. We give also an equitable $(n+2)$-algorithm for all GLS block graphs. As a by product we prove that the equitable chromatic spectrum for the subclass of GLS block graphs is gap-free., Comment: arXiv admin note: text overlap with arXiv:2009.12784

In this paper, we reduce the maximum weighted matching problem to the largest cardinality matching in {\bf CONGEST}. The paper presents two technical contributions. The first of them is a simple $poly(\log n, \frac{1}{\varepsilon}, t, \ln w_t)$-round {\bf CONGEST} algorithm for reducing the maximum weighted matching problem to the largest cardinality matching problem. This is achieved under the assumption that all vertices know all edge-weights $\{w_1,....,w_t\}$ (in particular, they know $t$, the number of different edge-weights), though a particular vertex may not know the weight of a particular edge. Our second ingredient is a simple rounding algorithm (similar to approximation algorithms for the bin packing problem) allowing to reduce general instances of the maximum weighted matching problem to ones satisfying the assumptions of the first ingredient, in which $t\leq poly'(\log n, \frac{1}{\varepsilon})$. We end the paper with a brief discussion of implementing our algorithms in {\bf CONGEST}. Our main conclusion is that we just need constant rounds for the reduction., Comment: 12 pages, no figures, This is the version of the paper first submitted on November 16, 2022

Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $\Delta$-edge-colorable subgraph and a matching. They further conjectured that every graph $G$ with chromatic index $\Delta(G)+k$ ($k\geq 1$) can be decomposed into a maximum $\Delta(G)$-edge-colorable subgraph (not necessarily class I) and a $k$-edge-colorable subgraph. In this paper, we first generalize their result to multigraphs and show that every multigraph $G$ with multiplicity $\mu$ can be decomposed into a maximum $\Delta(G)$-edge-colorable subgraph and a subgraph with maximum degree at most $\mu$. Then we prove that every graph $G$ with chromatic index $\Delta(G)+k$ can be decomposed into two class I subgraphs $H_1$ and $H_2$ such that $\Delta(H_1) = \Delta(G)$ and $\Delta(H_2) = k$, which is a variation of their conjecture., Comment: 9 pages, no figures

In the classical partial vertex cover problem, we are given a graph $G$ and two positive integers $R$ and $L$. The goal is to check whether there is a subset $V'$ of $V$ of size at most $R$, such that $V'$ covers at least $L$ edges of $G$. The problem is NP-hard as it includes the Vertex Cover problem. Previous research has addressed the extension of this problem where one has weight-functions defined on sets of vertices and edges of $G$. In this paper, we consider the following version of the problem where on the input we are given an edge-weighted bipartite graph $G$, and three positive integers $R$, $S$ and $T$. The goal is to check whether $G$ has a subset $V'$ of vertices of $G$ of size at most $R$, such that the edges of $G$ covered by $V'$ have weight at least $S$ and they include a matching of weight at least $T$. In the paper, we address this problem from the perspective of fixed-parameter tractability. One of our hardness results is obtained via a reduction from the bi-objective knapsack problem, which we show to be W[1]-hard with respect to one of parameters. We believe that this problem might be useful in obtaining similar results in other situations., Comment: 18 pages

If $f:\mathbb{N}\rightarrow \mathbb{N}$ is a function, then let us say that $f$ is sublinear if \[\lim_{n\rightarrow +\infty}\frac{f(n)}{n}=0.\] If $G=(V,E)$ is a cubic graph and $c:E\rightarrow \{1,...,k\}$ is a proper $k$-edge-coloring of $G$, then an edge $e=uv$ of $G$ is poor (rich) in $c$, if the edges incident to $u$ and $v$ are colored with three (five) colors. An edge is abnormal if it is neither rich nor poor. The Petersen coloring conjecture of Jaeger states that any bridgeless cubic graph admits a proper 5-edge-coloring $c$, such that there is no an abnormal edge of $G$ with respect to $c$. For a proper 5-edge-coloring $c$ of $G$, let $N_G(c)$ be the set of abnormal edges of $G$ with respect to $c$. In this paper we show that (a) The Petersen coloring conjecture is equivalent to the statement that there is a sublinear function $f:\mathbb{N}\rightarrow \mathbb{N}$, such that all bridgeless cubic graphs admit a proper 5-edge-coloring $c$ with $|N_G(c)|\leq f(|V|)$; (b) for $k=2,3,4$, the statement that there is a sublinear function $f:\mathbb{N}\rightarrow \mathbb{N}$, such that all (cyclically) $k$-edge-connected cubic graphs admit a proper 5-edge-coloring $c$ with $|N_G(c)|\leq f(|V|)$ is equivalent to the statement that all (cyclically) $k$-edge-connected cubic graphs admit a proper 5-edge-coloring $c$ with $|N_G(c)|\leq 2k+1$., Comment: 10 pages, 4 figures

An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem., Comment: 19 pages, 2 figures, final version

A function $f:N\rightarrow N$ is sublinear, if \[\lim_{x\rightarrow +\infty}\frac{f(x)}{x}=0.\] If $A$ is an Abelian group, $G$ is a graph and $\phi$ is an $A$-flow in $G$, then let $N(\phi)$ be the nullity of $\phi$, that is, the set of edges $e$ of $G$ with $\phi(e)=0$. In this paper we show that (a) Tutte's 5-flow conjecture is equivalent to the statement that there is a sublinear function $f$, such that all $3$-edge-connected cubic graphs admit a $\mathbb{Z}_5$-flow $\phi$ (not necessarily no-where zero), such that $|N(\phi)|\leq f(|E(G)|)$; (b) Tutte's 4-flow conjecture is equivalent to the statement that there is a sublinear function $f$, such that all bridgeless graphs without a Petersen minor admit a $\mathbb{Z}_4$-flow $\phi$ (not necessarily no-where zero), such that $|N(\phi)|\leq f(|E(G)|)$; (c) Tutte's 3-flow conjecture is equivalent to the statement that there is a sublinear function $f$, such that all $4$-edge-connected graphs admit a $\mathbb{Z}_3$-flow $\phi$ (not necessarily no-where zero), such that $|N(\phi)|\leq f(|E(G)|)$., Comment: the results of the preprint have been obtained previously in "M. Kochol, Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property, Discrete Mathematics 254 (2002) 221 -- 230", https://doi.org/10.1016/S0012-365X(01)00372-7

Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problems, a counterexample must be a snark, i.e. a bridgeless cubic graph which is not 3--edge-colourable. In this paper we deal with the fact that the family of potential counterexamples to many interesting conjectures can be narrowed even further to the family ${\cal S}_{\geq 5}$ of bridgeless cubic graphs whose edge set cannot be covered with four perfect matchings. The Cycle Double Cover Conjecture, the Shortest Cycle Cover Conjecture and the Fan-Raspaud Conjecture are examples of statements for which ${\cal S}_{\geq 5}$ is crucial. In this paper, we study parameters which have the potential to further refine ${\cal S}_{\geq 5}$ and thus enlarge the set of cubic graphs for which the mentioned conjectures can be verified. We show that ${\cal S}_{\geq 5}$ can be naturally decomposed into subsets with increasing complexity, thereby producing a natural scale for proving these conjectures. More precisely, we consider the following parameters and questions: given a bridgeless cubic graph, (i) how many perfect matchings need to be added, (ii) how many copies of the same perfect matching need to be added, and (iii) how many 2--factors need to be added so that the resulting regular graph is Class I? We present new results for these parameters and we also establish some strong relations between these problems and some long-standing conjectures., Comment: 27 pages, 16 figures

An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors needed to equitably color every block graph. In other words, the difference between the upper and the lower bounds of our conjecture is at most one. Thus, in some sense, the situation is similar to that of chromatic index, where we have the classical theorem of Vizing and the Goldberg conjecture for multigraphs. The results obtained in the paper support our conjecture. More precisely, we verify it in the class of well-covered block graphs, which are block graphs in which each vertex belongs to a maximum independent set. We also show that the conjecture is true for block graphs, which contain a vertex that does not lie in an independent set of size larger than two. Finally, we verify the conjecture for some symmetric-like block graphs. In order to derive our results we obtain structural characterizations of block graphs from these classes., Comment: 21 pages, 12 figures

In the weighted partial vertex cover problem (WPVC), we are given a graph $G=(V,E)$, cost function $c:V\rightarrow N$, profit function $p:E\rightarrow N$, and positive integers $R$ and $L$. The goal is to check whether there is a subset $V'\subseteq V$ of cost at most $R$, such that the total profit of edges covered by $V'$ is at least $L$. In this paper we study the fixed-parameter tractability of WPVC in bipartite graphs (WPVCB). By extending the methods of Amini et al., we show that WPVCB is FPT with respect to $R$ if $c\equiv 1$. On the negative side, it is $W[1]$-hard for arbitrary $c$, even when $p\equiv 1$. In particular, WPVCB is $W[1]$-hard parameterized by $R$. We complement this negative result by proving that for bounded-degree graphs WPVC is FPT with respect to $R$. The same result holds for the case of WPVCB when we allow to take only one fractional vertex. Additionally, we show that WPVC is FPT with respect to $L$. Finally, we discuss a variant of PVCB in which the edges covered are constrained to include a matching of prescribed size and derive a paramterized algorithm for the same., Comment: 12 pages, no figures

In the Maximum Connectivity Improvement (MCI) problem, we are given a directed graph $G=(V,E)$ and an integer $B$ and we are asked to find $B$ new edges to be added to $G$ in order to maximize the number of connected pairs of vertices in the resulting graph. The MCI problem has been studied from the approximation point of view. In this paper, we approach it from the parameterized complexity perspective in the case of directed acyclic graphs. We show several hardness and algorithmic results with respect to different natural parameters. Our main result is that the problem is $W[2]$-hard for parameter $B$ and it is FPT for parameters $|V| - B$ and $\nu$, the matching number of $G$. We further characterize the MCI problem with respect to other complementary parameters., Comment: 15 pages, 1 figure

We consider the problem of assigning tasks to agents under time conflicts, with applications also to frequency allocations in point-to-point wireless networks. In particular, we are given a set $V$ of $n$ agents, a set $E$ of $m$ tasks, and $k$ different time slots. Each task can be carried out in one of the $k$ predefined time slots, and can be represented by the subset $e\subseteq E$ of the involved agents. Since each agent cannot participate to more than one task simultaneously, we must find an allocation that assigns non-overlapping tasks to each time slot. Being the number of slots limited by $k$, in general it is not possible to executed all the possible tasks, and our aim is to determine a solution maximizing the overall social welfare, that is the number of executed tasks. We focus on the restriction of this problem in which the number of time slots is fixed to be $k=2$, and each task is performed by exactly two agents, that is $|e|=2$. In fact, even under this assumptions, the problem is still challenging, as it remains computationally difficult. We provide parameterized complexity results with respect to several reasonable parameters, showing for the different cases that the problem is fixed-parameter tractable or it is paraNP-hard., Comment: 31 pages, 3 figures

In a proper edge-coloring of a cubic graph an edge $uv$ is called poor or rich, if the set of colors of the edges incident to $u$ and $v$ contains exactly three or five colors, respectively. An edge-coloring of a graph is normal, if any edge of the graph is either poor or rich. In this note, we show that some snarks constructed by using a method introduced by Loupekhine admit a normal edge-coloring with five colors. The existence of a Berge-Fulkerson Covering for a part of the snarks considered in this paper was recently proved by Manuel and Shanthi (2015). Since the existence of a normal edge-coloring with five colors implies the existence of a Berge-Fulkerson Covering, our main theorem can be viewed as a generalization of their result., Comment: 8 pages, 6 figures

In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of colors assigned to the edge and the four edges adjacent it, has exactly five or exactly three distinct colors, respectively. An edge is normal in an edge-coloring if it is rich or poor in this coloring. A normal $k$-edge-coloring of a cubic graph is an edge-coloring with $k$ colors such that each edge of the graph is normal. We denote by $\chi'_{N}(G)$ the smallest $k$, for which $G$ admits a normal $k$-edge-coloring. Normal edge-colorings were introduced by Jaeger in order to study his well-known Petersen Coloring Conjecture. It is known that proving $\chi'_{N}(G)\leq 5$ for every bridgeless cubic graph is equivalent to proving Petersen Coloring Conjecture. Moreover, Jaeger was able to show that it implies classical conjectures like Cycle Double Cover Conjecture and Berge-Fulkerson Conjecture. Recently, two of the authors were able to show that any simple cubic graph admits a normal $7$-edge-coloring, and this result is best possible. In the present paper, we show that any claw-free bridgeless cubic graph, permutation snark, tree-like snark admits a normal $6$-edge-coloring. Finally, we show that any bridgeless cubic graph $G$ admits a $6$-edge-coloring such that at least $\frac{7}{9}\cdot |E|$ edges of $G$ are normal., Comment: 17 pages, 11 figures. arXiv admin note: text overlap with arXiv:1804.09449

If $G$ and $H$ are two cubic graphs, then an $H$-coloring of $G$ is a proper edge-coloring $f$ with edges of $H$, such that for each vertex $x$ of $G$, there is a vertex $y$ of $H$ with $f(\partial_G(x))=\partial_H(y)$. If $G$ admits an $H$-coloring, then we will write $H\prec G$. The Petersen coloring conjecture of Jaeger ($P_{10}$-conjecture) states that for any bridgeless cubic graph $G$, one has: $P_{10}\prec G$. The Sylvester coloring conjecture ($S_{10}$-conjecture) states that for any cubic graph $G$, $S_{10}\prec G$. In this paper, we introduce two new conjectures that are related to these conjectures. The first of them states that any cubic graph with a perfect matching admits an $S_{12}$-coloring. The second one states that any cubic graph $G$ whose edge-set can be covered with four perfect matchings, admits a $P_{12}$-coloring. We call these new conjectures $S_{12}$-conjecture and $P_{12}$-conjecture, respectively. Our first results justify the choice of graphs in $S_{12}$-conjecture and $P_{12}$-conjecture. Next, we characterize the edges of $P_{12}$ that may be fictive in a $P_{12}$-coloring of a cubic graph $G$. Finally, we relate the new conjectures to the already known conjectures by proving that $S_{12}$-conjecture implies $S_{10}$-conjecture, and $P_{12}$-conjecture and $(5,2)$-Cycle cover conjecture together imply $P_{10}$-conjecture. Our main tool for proving the latter statement is a new reformulation of $(5,2)$-Cycle cover conjecture, which states that the edge-set of any claw-free bridgeless cubic graph can be covered with four perfect matchings., Comment: 15 pages, 6 figures

A {\it clutter} (or {\it antichain} or {\it Sperner family}) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Normally, the elements of $V$ are called {\it vertices} of $L$, and the elements of $E$ are called {\it edges} of $L$. A subset $s_e$ of an edge $e$ of a clutter is {\it recognizing} for $e$, if $s_e$ is not a subset of another edge. The {\it hardness} of an edge $e$ of a clutter is the ratio of the size of $e\textrm{'s}$ smallest recognizing subset to the size of $e$. The hardness of a clutter is the maximum hardness of its edges. In this short note we prove a lower bound for the hardness of an arbitrary clutter. Our bound is asymptotically best-possible in a sense that there is an infinite sequence of clutters attaining our bound., Comment: 5 pages, no figures. arXiv admin note: text overlap with arXiv:0903.4907

If $k\geq 0$, then a $k$-edge-coloring of a graph $G$ is an assignment of colors to edges of $G$ from the set of $k$ colors, so that adjacent edges receive different colors. A $k$-edge-colorable subgraph of $G$ is maximum if it is the largest among all $k$-edge-colorable subgraphs of $G$. For a graph $G$ and $k\geq 0$, let $\nu_{k}(G)$ be the number of edges of a maximum $k$-edge-colorable subgraph of $G$. In 2010 Mkrtchyan et al. proved that if $G$ is a cubic graph, then $\nu_2(G)\leq \frac{|V|+2\nu_3(G)}{4}$. This result implies that if the cubic graph $G$ contains a perfect matching, in particular when it is bridgeless, then $\nu_2(G)\leq \frac{\nu_1(G)+\nu_3(G)}{2}$. One may wonder whether there are other interesting graph-classes, where a relation between $\nu_2(G)$ and $\frac{\nu_1(G)+\nu_3(G)}{2}$ can be proved. Related with this question, in this paper we show that $\nu_{k}(G) \geq \frac{\nu_{k-i}(G) + \nu_{k+i}(G)}{2}$ for any bipartite graph $G$, $k\geq 0$ and $i=0,1,...,k$., Comment: 11 pages, 1 figure

The classical Berge-Fulkerson conjecture states that any bridgeless cubic graph $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to two of the perfect matchings from the list. In this short note, we discuss two statements that are consequences of this conjecture. We show that the first statement is equivalent to Fan-Raspaud conjecture. We also show that the smallest counter-example to the second one is a cyclically $4$-edge-connected cubic graph., Comment: 3 pages

A normal $k$-edge-coloring of a cubic graph is an edge-coloring with $k$ colors having the additional property that when looking at the set of colors assigned to any edge $e$ and the four edges adjacent it, we have either exactly five distinct colors or exactly three distinct colors. We denote by $\chi'_{N}(G)$ the smallest $k$, for which $G$ admits a normal $k$-edge-coloring. Normal $k$-edge-colorings were introduced by Jaeger in order to study his well-known Petersen Coloring Conjecture. More precisely, it is known that proving $\chi'_{N}(G)\leq 5$ for every bridgeless cubic graph is equivalent to proving Petersen Coloring Conjecture and then, among others, Cycle Double Cover Conjecture and Berge-Fulkerson Conjecture. Considering the larger class of all simple cubic graphs (not necessarily bridgeless), some interesting questions naturally arise. For instance, there exist simple cubic graphs, not bridgeless, with $\chi'_{N}(G)=7$. On the other hand, the known best general upper bound for $\chi'_{N}(G)$ was $9$. Here, we improve it by proving that $\chi'_{N}(G)\leq7$ for any simple cubic graph $G$, which is best possible. We obtain this result by proving the existence of specific no-where zero $\mathbb{Z}_2^2$-flows in $4$-edge-connected graphs., Comment: 17 pages, 6 figures

For $k \geq 1$ and a graph $G$ let $\nu_k(G)$ denote the size of a maximum $k$-edge-colorable subgraph of $G$. Mkrtchyan, Petrosyan and Vardanyan proved that $\nu_2(G)\geq \frac45\cdot |V(G)|$, $\nu_3(G)\geq \frac76\cdot |V(G)|$ for any cubic graph $G$ ~\cite{samvel:2010}. They were also able to show that if $G$ is a cubic graph, then $\nu_2(G)+\nu_3(G)\geq 2\cdot |V(G)|$ ~\cite{samvel:2014} and $\nu_2(G) \leq \frac{|V(G)| + 2\cdot \nu_3(G)}{4}$ ~\cite{samvel:2010}. In the first part of the present work, we show that the last two inequalities imply the first two of them. Moreover, we show that $\nu_2(G) \geq \alpha \cdot \frac{|V(G)| + 2\cdot \nu_3(G)}{4} $, where $\alpha=\frac{16}{17}$, if $G$ is a cubic graph, $\alpha=\frac{20}{21}$, if $G$ is a cubic graph containing a perfect matching, $\alpha=\frac{44}{45}$, if $G$ is a bridgeless cubic graph. We also investigate the parameters $\nu_2(G)$ and $\nu_3(G)$ in the class of claw-free cubic graphs. We improve the lower bounds for $\nu_2(G)$ and $\nu_3(G)$ for claw-free bridgeless cubic graphs to $\nu_2(G)\geq \frac{35}{36}\cdot |V(G)|$ ($n \geq 48$), $\nu_3(G)\geq \frac{43}{45}\cdot |E(G)|$. On the basis of these inequalities we are able to improve the coefficient $\alpha$ for bridgeless claw-free cubic graphs. In the second part of the work, we prove lower bounds for $\nu_k(G)$ in terms of $\frac{\nu_{k-1}(G)+\nu_{k+1}(G)}{2}$ for $k\geq 2$ and graphs $G$ containing at most $1$ cycle. We also present the corresponding conjectures for bipartite and nearly bipartite graphs., Comment: 22 pages, 14 figures

If $G$ and $H$ are two cubic graphs, then an $H$-coloring of $G$ is a proper edge-coloring $f$ with edges of $H$, such that for each vertex $x$ of $G$, there is a vertex $y$ of $H$ with $f(\partial_G(x))=\partial_H(y)$. If $G$ admits an $H$-coloring, then we will write $H\prec G$. The Petersen coloring conjecture of Jaeger states that for any bridgeless cubic graph $G$, one has: $P\prec G$. The second author has recently introduced the Sylvester coloring conjecture, which states that for any cubic graph $G$ one has: $S\prec G$. Here $S$ is the Sylvester graph on $10$ vertices. In this paper, we prove the analogue of Sylvester coloring conjecture for cubic pseudo-graphs. Moreover, we show that if $G$ is any connected simple cubic graph $G$ with $G\prec P$, then $G = P$. This implies that the Petersen graph does not admit an $S_{16}$-coloring, where $S_{16}$ is the smallest connected simple cubic graph without a perfect matching. $S_{16}$ has $16$ vertices. %We conjecture that there are infinitely many connected cubic simple graphs which do not admit an %$S_{16}$-coloring. Finally, we obtain $2$ results towards the Sylvester coloring conjecture. The first result states that any cubic graph $G$ has a coloring with edges of Sylvester graph $S$ such that at least $\frac45$ of vertices of $G$ meet the conditions of Sylvester coloring conjecture. The second result states that any claw-free cubic graph graph admits an $S$-coloring. This results is an application of our result on cubic pseudo-graphs., Comment: 18 pages, 14 figures

This book is based on Graph Theory courses taught by P.A. Petrosyan, V.V. Mkrtchyan and R.R. Kamalian at Yerevan State University., Comment: 215 pages (in Armenian)

The modern integrated circuit is one of the most complex products that has been engineered to-date. It continues to grow in complexity as the years progress. As a result, very large-scale integrated (VLSI) circuit design now involves massive design teams employing state-of-the art computer-aided design (CAD) tools. One of the oldest, yet most important CAD problems for VLSI circuits is physical design automation, where one needs to compute the best physical layout of millions to billions of circuit components on a tiny silicon surface \cite{Lim08}. The process of mapping an electronic design to a chip involves a number of physical design stages, one of which is clustering. In this paper, we focus on problems in clustering which are critical for more sustainable chips. The clustering problem in combinatorial circuits alone is a source of multiple models. In particular, we consider the problem of clustering combinatorial circuits for delay minimization, when logic replication is not allowed ({\sc CN}). The problem of delay minimization when logic replication is allowed ({\sc CA}) has been well studied, and is known to be solvable in polynomial-time \cite{Wong1}. However, unbounded logic replication can be quite expensive. Thus, {\sc CN} is an important problem. We show that selected variants of {\sc CN} are {\bf NP-hard}. We also obtain approximability and inapproximability results for these problems. A preliminary version of this paper appeared in \cite{Don15}., Comment: 20 pages, 10 figures

A graph is equitably $k$-colorable if its vertices can be partitioned into $k$ independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest $k$ for which such a coloring exists is known as the equitable chromatic number of $G$ and denoted $\chi_{=}(G)$. It is known that this problem is NP-hard in general case and remains so for corona graphs. In "Equitable colorings of Cartesian products of graphs" (2012) Lin and Chang studied equitable coloring of Cartesian products of graphs. In this paper we consider the same model of coloring in the case of corona products of graphs. In particular, we obtain some results regarding the equitable chromatic number for $l$-corona product $G \circ ^l H$, where $G$ is an equitably 3- or 4-colorable graph and $H$ is an $r$-partite graph, a path, a cycle or a complete graph. Our proofs are constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of $G$. Moreover, we confirm Equitable Coloring Conjecture for corona products of such graphs. This paper extends our results from \cite{hf}., Comment: 14 pages, 1 figure

If $G$ and $H$ are two cubic graphs, then we write $H\prec G$, if $G$ admits a proper edge-coloring $f$ with edges of $H$, such that for each vertex $x$ of $G$, there is a vertex $y$ of $H$ with $f(\partial_G(x))=\partial_H(y)$. Let $P$ and $S$ be the Petersen graph and the Sylvester graph, respectively. In this paper, we introduce the Sylvester coloring conjecture. Moreover, we show that if $G$ is a connected bridgeless cubic graph with $G\prec P$, then $G=P$. Finally, if $G$ is a connected cubic graph with $G\prec S$, then $G=S$., Comment: 6 pages, 2 figures, + the comments of the referees are taken into account+ Sylvester coloring conjecture is introduced+ a result related with this conjectures is proved

A subgraph $H$ of a multigraph $G$ is called strongly spanning, if any vertex of $G$ is not isolated in $H$, while it is called maximum $k$-edge-colorable, if $H$ is proper $k$-edge-colorable and has the largest size. We introduce a graph-parameter $sp(G)$, that coincides with the smallest $k$ that a graph $G$ has a strongly spanning maximum $k$-edge-colorable subgraph. Our first result offers some alternative definitions of $sp(G)$. Next, we show that $\Delta(G)$ is an upper bound for $sp(G)$, and then we characterize the class of graphs $G$ that satisfy $sp(G)=\Delta(G)$. Finally, we prove some bounds for $sp(G)$ that involve well-known graph-theoretic parameters., Comment: 12 pages, no figures

We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$., Comment: 4 pages, no figures

The resistance $r(G)$ of a graph $G$ is the minimum number of edges that have to be removed from $G$ to obtain a graph which is $\Delta(G)$-edge-colorable. The paper relates the resistance to other parameters that measure how far is a graph from being $\Delta$-edge-colorable. The first part considers regular graphs and the relation of the resistance to structural properties in terms of 2-factors. The second part studies general (multi-) graphs $G$. Let $r_v(G)$ be the minimum number of vertices that have to be removed from $G$ to obtain a class 1 graph. We show that $\frac{r(G)}{r_v(G)} \leq \lfloor \frac{\Delta(G)}{2} \rfloor$, and that this bound is best possible., Comment: 9 pages

An $r$-graph is an $r$-regular graph where every odd set of vertices is connected by at least $r$ edges to the rest of the graph. Seymour conjectured that any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph contains $2r$ perfect matchings such that each edge belongs to two of them. We show that the minimum counter-example to either of these conjectures is a brick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud., Comment: 4 pages

A graph $G$ is class II, if its chromatic index is at least $\Delta+1$. Let $H$ be a maximum $\Delta$-edge-colorable subgraph of $G$. The paper proves best possible lower bounds for $\frac{|E(H)|}{|E(G)|}$, and structural properties of maximum $\Delta$-edge-colorable subgraphs. It is shown that every set of vertex-disjoint cycles of a class II graph with $\Delta\geq3$ can be extended to a maximum $\Delta$-edge-colorable subgraph. Simple graphs have a maximum $\Delta$-edge-colorable subgraph such that the complement is a matching. Furthermore, a maximum $\Delta$-edge-colorable subgraph of a simple graph is always class I., Comment: 13 pages, 2 figures, the proof of the Lemma 1 is corrected

We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices. Finally, for a cubic graph $G$, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let $H$ be the largest matching among such pairs. Let $M$ be a maximum matching of $G$. We show that 9/8 is a tight upper bound for $|M|/|H|$., Comment: 31 pages, 14 figures, majorly revised

A {\it clutter} (or {\it antichain} or {\it Sperner family}) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Usually, the elements of $V$ are called {\it vertices} of $L$, and the elements of $E$ are called {\it edges} of $L$. A subset $s_e$ of an edge $e$ of a clutter is called {\it recognizing} for $e$, if $s_e$ is not a subset of another edge. The {\it hardness} of an edge $e$ of a clutter is the ratio of the size of $e\textrm{'s}$ smallest recognizing subset to the size of $e$. The hardness of a clutter is the maximum hardness of its edges. We study the hardness of clutters arising from independent sets and matchings of graphs., Comment: 23 pages, 5 figures

For a graph $G$ let $L(G)$ and $l(G)$ denote the size of the largest and smallest maximum matching of a graph obtained from $G$ by removing a maximum matching of $G$. We show that $L(G)\leq 2l(G),$ and $L(G)\leq (3/2)l(G)$ provided that $G$ contains a perfect matching. We also characterize the class of graphs for which $L(G)=2l(G)$. Our characterization implies the existence of a polynomial algorithm for testing the property $L(G)=2l(G)$. Finally we show that it is $NP$-complete to test whether a graph $G$ containing a perfect matching satisfies $L(G)=(3/2)l(G)$., Comment: 11 pages, no figures

For $i=2,3$ and a cubic graph $G$ let $\nu_{i}(G)$ denote the maximum number of edges that can be covered by $i$ matchings. We show that $\nu_{2}(G)\geq {4/5}| V(G)| $ and $\nu_{3}(G)\geq {7/6}| V(G)| $. Moreover, it turns out that $\nu_{2}(G)\leq \frac{|V(G)|+2\nu_{3}(G)}{4}$., Comment: 41 pages, 8 figures, minor chages

We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph., Comment: 6 pages