相关论文: Splitting Planar Graphs of Girth 6 into Two Linear…

A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…

For positive integers $\ell$ and $k$, a $(1^\ell, 2^k)$-packing edge-coloring of a graph $G$ is a partition of $E(G)$ into $\ell$ matchings and $k$ induced matchings. A graph is $d$-irregular if it has no adjacent vertices of degree $d$.…

In this work, we introduce DPG-coloring using the concepts of DP-coloring and variable degeneracy to modify the proofs on the following papers: (i) DP-3-coloring of planar graphs without $4$, $9$-cycles and cycles of two lengths from $\{6,…

A graph $G$ is $(1,3)$-colorable if its vertices can be partitioned into subsets $V_1$ and $V_2$ so that every vertex in $G[V_1]$ has degree at most $1$ and every vertex in $G[V_2]$ has degree at most $3$. We prove that every graph with…

The strong chromatic index of a graph $G$, denoted $\chi_s'(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted…

A graph is $(\mathcal{I}, \mathcal{F})$-colorable if its vertex set can be partitioned into two subsets, one of which is an independent set, and the other induces a forest. In this paper, we prove that every planar graph without…

A strong edge-coloring of a graph $G$ is a coloring of edges of $G$ such that every color class forms an induced matching. The strong chromatic index is the minimum number of colors needed to color the graph. The Ore-degree $\theta(G)$ of a…

Balogh, Bar\'at, Gerbner, Gy\'arf\'as, and S\'ark\"ozy proposed the following conjecture. Let $G$ be a graph on $n$ vertices with minimum degree at least $3n/4$. Then for every $2$-edge-colouring of $G$, the vertex set $V(G)$ may be…

We study squares of planar graphs with the aim to determine their list chromatic number. We present new upper bounds for the square of a planar graph with maximum degree $\Delta \leq 4$. In particular $G^2$ is 5-, 6-, 7-, 8-, 12-,…

A matching of a graph is a set of edges without common end vertex. A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Recently, Biedl and Wittnebel proved that every 1-planar graph…

A proper edge coloring of a graph $G$ with colors $1,2,\dots,t$ is called a \emph{cyclic interval $t$-coloring} if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is…

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order…

In 2019, Letzter confirmed a conjecture of Balogh, Bar\'at, Gerbner, Gy\'arf\'as and S\'ark\"ozy, proving that every large $2$-edge-coloured graph $G$ on $n$ vertices with minimum degree at least $3n/4$ can be partitioned into two…

A well-known result by Haxell and Kohayakawa states that the vertices of an $r$-coloured complete graph can be partitioned into $r$ monochromatic connected subgraphs of distinct colours; this is a slightly weaker variant of a conjecture by…

We provide a simplified proof of the following special case of Wegner's conjecture: every planar graph of maximum degree at most three admits a distance-2 coloring with at most eight colors. Our main contribution is significant…

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is…

Strengthened notions of a matching $M$ of a graph $G$ have been considered, requiring that the matching $M$ has some properties with respect to the subgraph $G_M$ of $G$ induced by the vertices covered by $M$: If $M$ is the unique perfect…

In this paper, we show that every planar graph without $4$-cycles and $6$-cycles has a partition of its vertex set into two sets, where one set induces a forest, and the other induces a forest with maximum degree at most $2$ (equivalently,…

A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is…

A set of colored graphs are compatible, if for every color $i$, the number of vertices of color $i$ is the same in every graph. A simultaneous embedding of $k$ compatibly colored graphs, each with $n$ vertices, consists of $k$ planar…