scholarly journals On the Total Neighbor Sum Distinguishing Index of IC-Planar Graphs

Symmetry ◽  
2021 ◽  
Vol 13 (10) ◽  
pp. 1787
Author(s):  
Donghan Zhang ◽  
Chao Li ◽  
Fugang Chao
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree

A proper total k-coloring ϕ of G with ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(z) for each uv∈E(G) is called a total neighbor sum distinguishing k-coloring, where EG(u)={uv|uv∈E(G)}. Pilśniak and Woźniak conjectured that every graph with maximum degree Δ exists a total neighbor sum distinguishing (Δ+3)-coloring. In this paper, we proved that any IC-planar graph with Δ≥12 satisfies this conjecture, which improves the result of Song and Xu [J. Comb. Optim., 2020, 39, 293–303].

scholarly journals Planar Graphs of Maximum Degree Six without 7-cycles are Class One

10.37236/2589 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Danjun Huang ◽  
Weifan Wang
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree

In this paper, we prove that every planar graph of maximum degree six without 7-cycles is class one.

scholarly journals Near-Colorings: Non-Colorable Graphs and NP-Completeness

10.37236/3509 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
M. Montassier ◽  
P. Ochem
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Fixed Integer ◽  
Np Completeness ◽  
Vertex Set ◽  
Np Complete

A graph $G$ is $(d_1,...,d_l)$-colorable if the vertex set of $G$ can be partitioned into subsets $V_1,\ldots ,V_l$ such that the graph $G[V_i]$ induced by the vertices of $V_i$ has maximum degree at most $d_i$ for all $1 \leq i \leq l$. In this paper, we focus on complexity aspects of such colorings when $l=2,3$. More precisely, we prove that, for any fixed integers $k,j,g$ with $(k,j) \neq (0,0)$ and $g\geq3$, either every planar graph with girth at least $g$ is $(k,j)$-colorable or it is NP-complete to determine whether a planar graph with girth at least $g$ is $(k,j)$-colorable. Also, for any fixed integer $k$, it is NP-complete to determine whether a planar graph that is either $(0,0,0)$-colorable or non-$(k,k,1)$-colorable is $(0,0,0)$-colorable. Additionally, we exhibit non-$(3,1)$-colorable planar graphs with girth 5 and non-$(2,0)$-colorable planar graphs with girth 7. 

scholarly journals A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Enqiang Zhu ◽  
Yongsheng Rao
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Simple Graph ◽  
Total Coloring ◽  
Sufficient Condition ◽  
Open Case ◽  
Total Coloring Conjecture

A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The total coloring conjecture (TCC) states that every simple graph G has a total ΔG+2-coloring, where ΔG is the maximum degree of G. This conjecture has been confirmed for planar graphs with maximum degree at least 7 or at most 5, i.e., the only open case of TCC is that of maximum degree 6. It is known that every planar graph G of ΔG≥9 or ΔG∈7,8 with some restrictions has a total ΔG+1-coloring. In particular, in (Shen and Wang, 2009), the authors proved that every planar graph with maximum degree 6 and without 4-cycles has a total 7-coloring. In this paper, we improve this result by showing that every diamond-free and house-free planar graph of maximum degree 6 is totally 7-colorable if every 6-vertex is not incident with two adjacent four cycles or three cycles of size p,q,ℓ for some p,q,ℓ∈3,4,4,3,3,4.

scholarly journals Colouring Planar Graphs With Three Colours and No Large Monochromatic Components

2014 ◽  
Vol 23 (4) ◽  
pp. 551-570 ◽  
Author(s):  
LOUIS ESPERET ◽  
GWENAËL JORET
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree

We prove the existence of a function $f :\mathbb{N} \to \mathbb{N}$ such that the vertices of every planar graph with maximum degree Δ can be 3-coloured in such a way that each monochromatic component has at most f(Δ) vertices. This is best possible (the number of colours cannot be reduced and the dependence on the maximum degree cannot be avoided) and answers a question raised by Kleinberg, Motwani, Raghavan and Venkatasubramanian in 1997. Our result extends to graphs of bounded genus.

scholarly journals Defective 3-Paintability of Planar Graphs

10.37236/7084 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Grzegorz Gutowski ◽  
Ming Han ◽  
Tomasz Krawczyk ◽  
Xuding Zhu
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Winning Strategy ◽  
Marked Vertex

A $d$-defective $k$-painting game on a graph $G$ is played by two players: Lister and Painter. Initially, each vertex is uncolored and has $k$ tokens. In each round, Lister marks a chosen set $M$ of uncolored vertices and removes one token from each marked vertex. In response, Painter colors vertices in a subset $X$ of $M$ which induce a subgraph $G[X]$ of maximum degree at most $d$. Lister wins the game if at the end of some round there is an uncolored vertex that has no more tokens left. Otherwise, all vertices eventually get colored and Painter wins the game. We say that $G$ is $d$-defective $k$-paintable if Painter has a winning strategy in this game. In this paper we show that every planar graph is 3-defective 3-paintable and give a construction of a planar graph that is not 2-defective 3-paintable.

scholarly journals Face-Degree Bounds for Planar Critical Graphs

10.37236/5895 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Ligang Jin ◽  
Yingli Kang ◽  
Eckhard Steffen
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Upper Bounds ◽  
Partial Characterization ◽  
Critical Graphs ◽  
Degree Bounds

The only remaining case of a well known conjecture of Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for planar graphs,  based on the degrees of the faces, and study the question whether there are upper bounds for these parameters for planar edge-chromatic critical graphs. Our results provide upper bounds on these parameters for smallest counterexamples to Vizing's conjecture, thus providing a partial characterization of such graphs, if they exist.For $k \leq 5$ the results give insights into the structure of planar edge-chromatic critical graphs.

A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5

2018 ◽  
Vol 10 (04) ◽  
pp. 1850044
Author(s):  
Tao Pan ◽  
Lei Sun
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Discrete Math ◽  
Distance Formula

It was proved in [Y. Bu and C. Shang, List 2-distance coloring of planar graphs without short cycles, Discrete Math. Algorithm. Appl. 8 (2016) 1650013] that for every planar graph with girth [Formula: see text] and maximum degree [Formula: see text] is list 2-distance [Formula: see text]-colorable. In this paper, we proved that: for every planar graph with [Formula: see text] and [Formula: see text] is list 2-distance [Formula: see text]-colorable.

scholarly journals On the Maximum Degree of Path-Pairable Planar Graphs

10.37236/7291 ◽  
2019 ◽  
Vol 26 (2) ◽  
Author(s):  
António Girão ◽  
Gábor Mészáros ◽  
Kamil Popielarz ◽  
Richard Snyder
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Disjoint Paths ◽  
Edge Disjoint ◽  
Finite Genus

A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex path-pairable planar graph must contain a vertex of degree linear in $n$. Our result generalizes to graphs embeddable on a surface of finite genus.  

scholarly journals Total Colorings of $F_5$-Free Planar Graphs with Maximum Degree 8

10.37236/3303 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Jian Chang ◽  
Jian-Liang Wu ◽  
Hui-Juan Wang ◽  
Zhan-Hai Guo
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Total Chromatic Number ◽  
Minimum Number ◽  
Fan Graph

The total chromatic number of a graph $G$, denoted by $\chi′′(G)$, is the minimum number of colors needed to color the vertices and edges of $G$ such that no two adjacent or incident elements get the same color. It is known that if a planar graph $G$ has maximum degree $\Delta ≥ 9$, then $\chi′′(G) = \Delta + 1$. The join $K_1 \vee P_n$ of $K_1$ and $P_n$ is called a fan graph $F_n$. In this paper, we prove that if $G$ is a $F_5$-free planar graph with maximum degree 8, then $\chi′′(G) = 9$.

scholarly journals On (p,1)-total labelling of plane graphs with independent crossings

Filomat ◽  
2012 ◽  
Vol 26 (6) ◽  
pp. 1091-1100 ◽  
Author(s):  
Xin Zhang ◽  
Guizhen Liu ◽  
Yong Yu
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Discrete Math ◽  
Plane Graph ◽  
Plane Graphs ◽  
High Maximum ◽  
Crossed Pair ◽  
Large Girth

Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane so that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, it is proved that the (p, 1)-total labelling number of every IC-planar graph G is at most ?(G) + 2p ? 2 provided that ?(G) ? ? and 1(G) ? 1, where (?, 1) ? {(6p + 2, 3), (4p + 2, 4), (2p + 5, 5)}. As a consequence, we generalize and improve some results obtained in [F. Bazzaro, M. Montassier, A. Raspaud, (d, 1)-Total labelling of planar graphs with large girth and high maximum degree, Discrete Math. 307 (2007) 2141-2151].

Sign in / Sign up

Export Citation Format

Share Document