16 research outputs found
List Coloring Some Classes of 1-Planar Graphs
In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its list and adjacent vertices are given different colors. In this thesis we study the problem of list coloring 1-planar graphs, i.e., graphs that can be drawn in the plane such that any edge intersects at most one other edge. We also study the closely related problem of simultaneously list coloring the vertices and faces of a planar graph, known as coupled list coloring.
We show that 1-planar bipartite graphs are list colorable whenever all lists are of size at least four, and further show that this coloring can be found in linear time. In pursuit of this result, we show that the previously known edge partition of a 1-planar graph into a planar graph and a forest can be found in linear time.
A wheel graph consists of a cycle of vertices, all of which are adjacent to an additional center vertex. We show that wheel graphs are coupled list colorable when all lists are of size five or more and show that this coloring can be found in linear time. Possible extensions of this result to planar partial 3-trees are discussed.
Finally, we discuss the complexity of list coloring 1-planar graphs, both in parameterized and unparameterized settings
Coloring and covering problems on graphs
The \emph{separation dimension} of a graph , written , is the minimum number of linear orderings of such that every two nonincident edges are ``separated'' in some ordering, meaning that both endpoints of one edge appear before both endpoints of the other. We introduce the \emph{fractional separation dimension} , which is the minimum of such that some linear orderings (repetition allowed) separate every two nonincident edges at least times.
In contrast to separation dimension, we show fractional separation dimension is bounded: always , with equality if and only if contains . There is no stronger bound even for bipartite graphs, since . We also compute for cycles and some complete tripartite graphs. We show that when is a tree and present a sequence of trees on which the value tends to . We conjecture that when the -free -vertex graph maximizing is .
We also consider analogous problems for circular orderings, where pairs of nonincident edges are separated unless their endpoints alternate. Let be the number of circular orderings needed to separate all pairs, and let be the fractional version. Among our results: (1) if and only is outerplanar. (2) when is bipartite. (3) . (4) , with equality if and only if . (5) .
A \emph{star -coloring} is a proper -coloring where the union of any two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-colorable. One method to produce a star 4-coloring is to partition the vertex set into a 2-independent set and a forest; such a partition is called an \emph{\Ifp}. We use discharging to prove that every graph with maximum average degree less than has an \Ifp, which is sharp and improves the result of Bu, Cranston, Montassier, Raspaud, and Wang (2009). As a corollary, we gain that every planar graph with girth at least 10 has a star 4-coloring.
A proper vertex coloring of a graph is \emph{-dynamic} if for each , at least colors appear in . We investigate -dynamic versions of coloring and list coloring. We prove that planar and toroidal graphs are 3-dynamically 10-choosable, and this bound is sharp for toroidal graphs.
Given a proper total -coloring of a graph , we define the \emph{sum value} of a vertex to be . The smallest integer such that has a proper total -coloring whose sum values form a proper coloring is the \emph{neighbor sum distinguishing total chromatic number} . Pil{\'s}niak and Wo{\'z}niak~(2013) conjectured that for any simple graph with maximum degree . We prove this bound to be asymptotically correct by showing that . The main idea of our argument relies on Przyby{\l}o's proof (2014) for neighbor sum distinguishing edge-coloring
Labeling of graphs, sumset of squares of units modulo n and resonance varieties of matroids
This thesis investigates problems in a number of different areas of graph theory and its applications in other areas of mathematics. Motivated by the 1-2-3-Conjecture, we consider the closed distinguishing number of a graph G, denoted by dis[G]. We provide new upper bounds for dis[G] by using the Combinatorial Nullstellensatz. We prove that it is NP-complete to decide for a given planar subcubic graph G, whether dis[G] = 2. We show that for each integer t there is a bipartite graph G such that dis[G] \u3e t. Then some polynomial time algorithms and NP-hardness results for the problem of partitioning the edges of a graph into regular and/or locally irregular subgraphs are presented. We then move on to consider Johnson graphs to find resonance varieties of some classes of sparse paving matroids. The last application we consider is in number theory, where we find the number of solutions of the equation x21 + _ _ _ + x2 k = c, where c 2 Zn, and xi are all units in the ring Zn. Our approach is combinatorial using spectral graph theory
Between proper and strong edge-colorings of subcubic graphs
In a proper edge-coloring the edges of every color form a matching. A
matching is induced if the end-vertices of its edges induce a matching. A
strong edge-coloring is an edge-coloring in which the edges of every color form
an induced matching. We consider intermediate types of edge-colorings, where
edges of some colors are allowed to form matchings, and the remaining form
induced matchings. Our research is motivated by the conjecture proposed in a
recent paper of Gastineau and Togni on S-packing edge-colorings (On S-packing
edge-colorings of cubic graphs, Discrete Appl. Math. 259 (2019), 63-75)
asserting that by allowing three additional induced matchings, one is able to
save one matching color. We prove that every graph with maximum degree 3 can be
decomposed into one matching and at most 8 induced matchings, and two matchings
and at most 5 induced matchings. We also show that if a graph is in class I,
the number of induced matchings can be decreased by one, hence confirming the
above-mentioned conjecture for class I graphs