On Brooks Coloring Theorem
|
|
- Arnold Daniel
- 5 years ago
- Views:
Transcription
1 On Brooks Coloring Theorem Hong-Jian Lai, Xiangwen Li, Gexin Yu Department of Mathematics West Virginia University Morgantown, WV, Abstract Let G be a connected finite simple graph. δ(g), (G) and χ(g) denote the minimum degree, the maximum degree and the chromatic number of G, respectivly. Brooks theorem states χ(g) (G) + 1. Szekeres and Wilf [J. Combinatorial Theory, 4 (1968) 1-33] and Cao [Linear Algebra Appl., 270 (1998) 1-13] extended Brooks Theorem by replacing (G) by a generic function γ(g) satisfying certain conditions. However, little is known about the graphs satisfying χ(g) = γ(g) + 1. In this paper, we extend the results by Szekeres and Wilf and by Cao to group colorings and investigate the structure of graphs satisfying the equality. Former results are obtained as applications. 1 Introduction Graphs in this note are finite and simple. Unless otherewise stated, we follow [1] for notations and terminology in graph theory. Thus δ(g), (G) and χ(g) denote the minimum degree, the maximum degree and the chromatic number of G, respectivly. We use H G to denote the fact that H is an induced subgraph of G. A graph G is uncyclic if G contains only one cycle. The concept of group coloring is first defined in [4], as the dual concept of group connectivity, which is a generalization of nowhere zero flows. For an (additive) Abelian group A, let F (G, A) denote the set of all maps from E(G) to A. A directed graph G is A-colorable if for any f F (G, A), there is a map c : V (G) A such that for every e = uv E(G), where e is directed from u to v, c(u) c(v) f(e). A graph G is A-colorable if under some orientation of G, G is A-colorable. It is known that that G is A-colorable is independent of the choice of the orientation. The group chromatic number of a graph G is defined to 1
2 be the minimum m for which G is A-colorable for any Abelian group A of order m, and is denoted by χ g (G). It follows from the definitions that, for any G, χ(g) χ g (G). The main purpose of this paper is to seek extensions of the well known Brooks coloring theorem, as stated below. Theorem 1.1 (Brooks, [2]) Let G be a connected graph. Then χ(g) (G) + 1, where equality holds if and only if G is complete or an odd cycle. Szekeres and Wilf [7], and Cao [3], respectively considered the following extention of Theorem 1.1. Let γ(g) be a real function on a graph G. Consider the following two properties: (P1) If H is an induced subgraph of G, then γ(h) γ(g); (P2) γ(g) δ(g) with equality if and only if G is regular. Szekeres and Wilf [7], and Gao [3] proved the following result: Theorem 1.2 (Szekeres and Wilf [7], Cao [3]) Let γ(g) be any real function on a graph G with properties (P1) and (P2). Then χ(g) γ(g) + 1. However, when G is connected and χ(g) = γ(g) + 1, G is not necessarily a complete graph or an odd cycle. Consider the following example. For a connected G, we define 0 if G = K 1 1 if G = K 2 γ(g) = 2 if G is unicyclic or a tree and G K 2 (G) otherwise. For disconnected graph G, γ(g) = max{γ(g i ) : G i is a connected component of G}. Then γ(g) satisfies (P1) and (P2). Therefore when G is a connected unicyclic graph with an odd girth, such that G is not a cycle, we have χ(g) = γ(g) + 1, but G is neither a cycle nor a complete graph. In Section 2, we extend the results by Szekeres and Wilf and by Cao to group colorings and investigate the structure of graphs satisfying the equality. In Section 3, we present some applications to show that several former results can be obtained as corollaries of our main results. 2
3 2 Main Results An analogue of Brooks group coloring theorem is proved in [5]. Theorem 2.1 (Lai and Zhang [5]) For any connected simple graph G, χ g (G) (G) + 1, where equality holds if and only if (G) = 2 and G is a cycle; or (G) 3 and G is complete. Define a graph G to be χ g (G)(or χ(g))-semi-critical if χ g (G v) < χ g (G)(or χ(g v) < χ(g)), for every vertex v G with d(v) = δ(g). Lemma 2.2 Let G be a graph and v V (G), and H = G v. If d G (v) < χ g (H), then χ g (G) = χ g (H). Proof. Without loss of generality we assume that G is oriented such that all the edges incident with v are oriented from v. Let N(v, G) = {v 1, v 2,..., v l }, l = d(v). Thus for any f : E(H) A, there is a map c : V (H) A such that c(x) c(y) f(xy) for each directed edge xy E(H). Since l < χ g (H) A, there is an a A l i=1 {c(v i) + f(v i )}. Therefore we extend c to c 1 : V (G) A by c(u) if u V (H) c 1 (u) = a if u = v. It follows that G is A-colorable and hence χ g (G) = χ g (H). Lemma 2.3 If G is χ g (G)-semicritical with χ g (G) = k, then d G (v) k 1 for all v V (G). Proof. By contradiction, assume that G has a vertex v 0 with d G (v 0 ) = δ(g) k 2. Since G is a χ g -semi-critical graph with χ g (G) = k, we have χ g (G v 0 ) k 1. Let A be an abelian group with A k 1. Then G v 0 is A-colorable. Since d G (v 0 ) < k 1, by Lemma 2.2, χ g (G) = χ g (G v 0 ) k 1, contrary to χ g (G) = k. Theorem 2.4 For any connected simple graph G, χ g (G) γ(g) + 1. If G is χ g (G)-semi-critical, then χ g (G) = γ(g) + 1 if and only if G is a cycle or a complete graph. 3
4 Proof. Let k = χ g (G). Let H G be a k-semi-critical induced subgraph. By (P1), γ(h) γ(g). By Lemma 2.3, δ(h) k 1. Thus we have k 1 δ(h) γ(h) γ(g), which implies that χ g (G) = k γ(g) + 1. Now consider the case when the equality holds. By (P2), γ(c) = 2 for any cycle C and γ(k n ) = n 1. Hence χ g (G) = γ(g) + 1 for a cycle or a complete graph. Conversely, let G be a χ g (G)-semi-critical graph such that χ g (G) = γ(g) + 1. By Lemma 2.3 and (P2), χ g (G) 1 δ(g) γ(g) = χ g (G) 1, which implies δ(g) = γ(g) and then G is regular by (P2). Therefore χ g (G) = γ(g) + 1 = δ(g) + 1 = (G) + 1 and by Theorem 2.1, G is a cycle or a complete graph. Corollary 2.5 Let γ(g) be any real function satisfying (P1) and (P2), then χ(g) γ(g) + 1. If G is semi-critical, then χ(g) = γ(g) + 1 if and only if G is an odd cycle or a complete graph. Next we shall study the structure of connected graphs with χ g (G) = γ(g) + 1. For a positive integer m, define F(m) to be the set of connected simple graphs such that: (1) For m = 1, G F(m) if and only if G is a tree and G K 2. (2) For m = 2, G F(m) if and only if G = K 2. (3) For m = 3, G F(m) if and only if either G is a cycle, or H = G v for some H F(m) and a vertex v with d(v) = 1. (4) For m 4, G F(m) if and only if either G = K m, a complete graph of order m, or H = G v for some H F(m) and a vertex v with d(v) m 2. From the definition, we see that if m = 3, G is a set of unicyclic graphs and if m 4, then F(m) is a set of graphs whose only maximum induced complete subgraph is a K m. Now we prove that when χ g (G) = γ(g) + 1, G must be in F(m) with m = χ g (G). Theorem 2.6 For any connected simple graph G, if χ g (G) = γ(g) + 1, then G F(m) with m = χ g (G). Proof. If χ g (G) = 1, 2, it is trivial. 4
5 Let χ g (G) 3 and H 0 be a χ g (G)-semi-critical induced subgraph of G, then χ g (H 0 ) = χ g (G) = γ(g) + 1 γ(h 0 ) + 1 χ g (H 0 ). So all equalities hold, we have χ g (H 0 ) = γ(h 0 ) + 1 and γ(h 0 ) = γ(g). Thus H 0 is a cycle or a complete graph by Theorem 2.4. Let m = χ g (H 0 ) = χ g (G), and then δ(h 0 ) = m 1. If χ g (G) = γ(g) + 1 and δ(g) m 1, then m = χ g (G) = γ(g) + 1 δ(g) + 1 m, and so γ(g) = δ(g) = m 1. Thus G is regular and since G is connected, G = H 0. For m = 3, H 0 is a cycle and so G F(3); for m 4, H 0 is a complete graph and so G F(m). Now we assume that χ g (G) = γ(g) + 1 and δ(g) m 2. Note that G cannot be a cycle (when m = 3) or a complete graph (when m 4). By Theorem 2.4, G cannot be semicritical. Therefore, there exists v V (G) with d(v) = δ(g) such that χ g (G) = χ g (G v). We use induction on V (G) to prove that G F(m). If V (G) = V (H 0 ) + 1, then G v = H 0 F(m), and by the definition of F(m), G F(m). Therefore we can assume that V (G) > V (H 0 ) + 1. Then by Lemma 2.2 and Property (P1), χ g (G v) = χ g (G) = γ(g) + 1 γ(g v) + 1 χ g (G v). So χ g (G v) = γ(g v) + 1 and by induction hypothesis, G v F(M). Therefore by the definition of F(m), G F(m) with m = χ g (G). Since χ(g) χ g (G) γ(g) + 1, that χ(g) = γ(g) + 1 implies χ g (G) = γ(g) + 1. Therefore when χ(g) = γ(g) + 1, we also have G F(m). Of course, if G is a unicyclic graph, the cylcle can not be even. Thus we have the following corollary, Corollary 2.7 For a connected graph G, if χ(g) = γ(g) + 1, then G F(m) for some m 3 or G is a unicyclic graph with odd girth or G = K 2. 3 Applications of the main results By Theorem 2.6 or Corollary 2.7, once more information about γ(g) is known, the connected graphs satisfying equality in Theorem 2.6 or Corollary 2.7 can be determined. This allows us to apply our main results and to obtain former results as corollaries, as seen below. The eigenvalues of G are the eigenvalues of its adjacenty matrix A(G). The largest eigenvalue of A(G) is called the spectral radius of G, denoted by ρ(g). Here are some results with respect to ρ(g). 5
6 Lemma 3.1 Each of the following holds: (i) ρ(k n ) = n 1, ρ(c n ) = 2. (ii) ρ(g) ρ(g v) for any vertex v G. (iii) For a graph G, either 2 E(G) V (G) < ρ(g) < (G) or 2 E(G) V (G) = ρ(g) = (G) and G is regular. The proof of these can be found in Liu and Lai [6], as Exercise 1.7, Theorem and Theorem 1.3.2A. Corollary 3.2 (Wilf [8]) Let G be a connected simple graph with spectral radius ρ(g). Then cycle; (i) χ g (G) ρ(g) + 1, where equality holds if and only if G is a complete graph or a (ii) χ(g) ρ(g) + 1, where equality holds if and only if G is a complete graph or an odd cycle. Proof. By Lemma 3.1, ρ(g) satisfies (P1) and (P2). Thus χ g (G) ρ(g) + 1. If G = K n or G = C, it is easy to see χ g (G) = ρ(g) + 1. Now let χ g (G) = ρ(g) + 1. By Theorem 2.6, G F(m). For m = 1, 2, it is easy to see the result holds. For m = 3, G F(m) implies χ g (G) = 3 and then ρ(g) = 2. As for any G F(3), E(G) = V (G), we have ρ(g) = 2 = 2 E(G) V (G) and so by Lemma 3.1(iii), G is regular. Thus G must be a cycle. For m 4, that G F(m) implies χ g (G) = m and K m G. Thus ρ(g) = m 1. As E(G) m(m 1) 2 + (m 2)(n m), where n = V (G), we have 0 = ρ(g) (m 1) 2 E(G) (m 1) n m(m 1) 2( 2 + (m 2)(n m)) (m 1) = (m 3)(1 m n n ) 0. Therefore all equalities must hold. Thus m = 3 or m = n, ρ(g) = 2 E(G) n regular. So m = n and G = K m. The proof for χ(g) is similar. and G is For a graph G with V (G) = {v 1, v 2,..., v n }, define the average degree of G to be l(g) = 2 E(G) V (G), and the maximum average degree of G to be L(G) = max{l(h) : 6
7 H is an induced subgraph of G}. It is easy to see that L(G) satisfies (P1) and (P2), and so we have Corollary 3.3 Let G be a connected simple graph with maximum average degree L(G). Then (i) χ g (G) L(G) + 1, where equality holds if and only if G = K 1 or G = K 2 or G is unicylic, or for m = χ g (G) 4, G F(m) and L(G) = m 1; (ii) χ(g) L(G) + 1, where equality holds if and only if G = K 1 or G = K 2, or G is a unicyclic graph with an odd girth, or for m = χ g (G) 4 G F(m) and L(G) = m 1. Proof. The proof is routine. Let the 2-degree of vertex v in a graph G, denoted by t(v), be the sum of degrees of the vertices adjacent to v in G, and let T (G) denote the maximum 2-degree of G. Corollary 3.4 (Cao, Theorem 3 of [3]) Let G be a connected simple graph with maximum 2-degree T (G). Then cycle. (i) χ g (G) T (G) + 1, where equality holds if and only if G is complete or a cycle; (ii) χ(g) T (G) + 1, where equality holds if and only if G is complete or an odd Proof. It is easy to check that T (G) satisfies (P1) and (P2). And so χ g (G) T (G)+1, and when χ g (G) = T (G) + 1, G F(m). For m = 1, 2, it is easy to see the result holds. For m = 3, G is a unicyclic graph. Then χ g (G) = 3. Since T (G) x with T (G) = 2 if and only if x = 0, that is, G must be a cycle. Similarly, for m 4, G F(m) and T (G) = m 1 if and only if G is a complete graph. The proof for χ(g) is similar. Define the k-degree of a vertex v in a graph G to be the number of walks of length 1 from v in G. The 2-degree is exactly the same as we defined before. Let k (G) be the maximum k-degree in a graph G which is the maximum row sum of A k, where A is the incident matrix of G. It is not hard to prove that the function [ k (G)] 1 k (P2). Similar to the proof of Corollary 3.4, we have satisfies (P1) and Corollary 3.5 (Cao [3]) Let G be a connected graph with maximum k-degree k (G). Then cycle. (i) χ g (G) [ k (G)] 1 k + 1, where equality holds if and only if G is complete or a cycle; (ii) χ(g) [ k (G)] 1 k + 1, where equality holds if and only if G is complete or an odd 7
8 References [1] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier, New York, [2] R. Brooks, On colouring the nodes of a network, Proc. Cambridge Phil. Soc. 37 (1941), [3] D. Cao, Bounds on eigenvalues and chromatic number, Linear Algebra Appl., 270 (1998), [4] F. Jaeger, N. Linial, C. Payan, and M. Tarsi, Graph Connectivity of Graphs A Nonhomogeneous Analogue of Nowhere-Zero Flow Properties, J. Combin. Theory Series B 56 (1992), [5] H.-J. Lai and X. Zhang, Group colorability of graphs, Ars Combinatorics, accepted. [6] B. Liu and H.-J. Lai, Matrices in combinatorics and graph theory, Kluwer Academic Publishers, Dordrecht, [7] G. Szekeres and H. S. Wilf, An inequality for the chromatic number of a graph, J. Combinatorial Theory 4 (1968) 1 3. [8] H. S. Wilf, The eigenvalues of a graph and its chromatic number, J. London Math. Soc. 42 (1967),
Group Colorability of Graphs
Group Colorability of Graphs Hong-Jian Lai, Xiankun Zhang Department of Mathematics West Virginia University, Morgantown, WV26505 July 10, 2004 Abstract Let G = (V, E) be a graph and A a non-trivial Abelian
More informationGraphs and Combinatorics
Graphs and Combinatorics (2005) 21:469 474 Digital Object Identifier (DOI) 10.1007/s00373-005-0625-0 Graphs and Combinatorics Springer-Verlag 2005 On Group Chromatic Number of Graphs Hong-Jian Lai 1 and
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More informationUpper Bounds of Dynamic Chromatic Number
Upper Bounds of Dynamic Chromatic Number Hong-Jian Lai, Bruce Montgomery and Hoifung Poon Department of Mathematics West Virginia University, Morgantown, WV 26506-6310 June 22, 2000 Abstract A proper vertex
More informationConditional colorings of graphs
Discrete Mathematics 306 (2006) 1997 2004 Note Conditional colorings of graphs www.elsevier.com/locate/disc Hong-Jian Lai a,d, Jianliang Lin b, Bruce Montgomery a, Taozhi Shui b, Suohai Fan c a Department
More informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationSpectral radii of graphs with given chromatic number
Applied Mathematics Letters 0 (007 158 16 wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationExtendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations
Graphs and Combinatorics (2016) 32:1065 1075 DOI 10.1007/s00373-015-1636-0 ORIGINAL PAPER Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations Yanting Liang 1 Hong-Jian
More informationDegree Sequence and Supereulerian Graphs
Degree Sequence and Supereulerian Graphs Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang and Ju Zhou January 29, 2007 Abstract A sequence d = (d 1, d 2,, d n ) is graphic if there is a simple graph
More informationGraph homomorphism into an odd cycle
Graph homomorphism into an odd cycle Hong-Jian Lai West Virginia University, Morgantown, WV 26506 EMAIL: hjlai@math.wvu.edu Bolian Liu South China Normal University, Guangzhou, P. R. China EMAIL: liubl@hsut.scun.edu.cn
More informationRegular matroids without disjoint circuits
Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if
More informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationColoring. Basics. A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]).
Coloring Basics A k-coloring of a loopless graph G is a function f : V (G) S where S = k (often S = [k]). For an i S, the set f 1 (i) is called a color class. A k-coloring is called proper if adjacent
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationEvery 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory, Series B 96 (26) 571 576 www.elsevier.com/locate/jctb Every 3-connected, essentially 11-connected line graph is Hamiltonian Hong-Jian Lai a, Yehong Shao b, Hehui Wu a,
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationHamiltonian claw-free graphs
Hamiltonian claw-free graphs Hong-Jian Lai, Yehong Shao, Ju Zhou and Hehui Wu August 30, 2005 Abstract A graph is claw-free if it does not have an induced subgraph isomorphic to a K 1,3. In this paper,
More informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationarxiv: v1 [math.co] 7 Nov 2018
DP-4-COLORABILITY OF TWO CLASSES OF PLANAR GRAPHS LILY CHEN 1 AND RUNRUN LIU 2 AND GEXIN YU 2, AND REN ZHAO 1 AND XIANGQIAN ZHOU 1,4 arxiv:1811.02920v1 [math.co] Nov 2018 1 School of Mathematical Sciences,
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationOn the Local Colorings of Graphs
On the Local Colorings of Graphs Behnaz Omoomi and Ali Pourmiri Department of Mathematical Sciences Isfahan University of Technology 84154, Isfahan, Iran Abstract A local coloring of a graph G is a function
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationThe spectral radius of edge chromatic critical graphs
The spectral radius of edge chromatic critical graphs Lihua Feng b, Jianxiang Cao c, Weijun Liu a,b, Shifeng Ding b, Henry Liu b a School of Science, Nantong University, Nantong, Jiangshu, 6019, China.
More informationEQUITABLE COLORING OF SPARSE PLANAR GRAPHS
EQUITABLE COLORING OF SPARSE PLANAR GRAPHS RONG LUO, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one.
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationThe chromatic number and the least eigenvalue of a graph
The chromatic number and the least eigenvalue of a graph Yi-Zheng Fan 1,, Gui-Dong Yu 1,, Yi Wang 1 1 School of Mathematical Sciences Anhui University, Hefei 30039, P. R. China fanyz@ahu.edu.cn (Y.-Z.
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationOn (δ, χ)-bounded families of graphs
On (δ, χ)-bounded families of graphs András Gyárfás Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, P.O. Box 63 Budapest, Hungary, H-1518 gyarfas@sztaki.hu Manouchehr
More informationComplexity of conditional colorability of graphs
Complexity of conditional colorability of graphs Xueliang Li 1, Xiangmei Yao 1, Wenli Zhou 1 and Hajo Broersma 2 1 Center for Combinatorics and LPMC-TJKLC, Nankai University Tianjin 300071, P.R. China.
More informationarxiv: v1 [math.co] 28 Oct 2015
Noname manuscript No. (will be inserted by the editor) A note on the Ramsey number of even wheels versus stars Sh. Haghi H. R. Maimani arxiv:1510.08488v1 [math.co] 28 Oct 2015 Received: date / Accepted:
More informationDestroying non-complete regular components in graph partitions
Destroying non-complete regular components in graph partitions Landon Rabern landon.rabern@gmail.com June 27, 2011 Abstract We prove that if G is a graph and r 1,..., r k Z 0 such that k i=1 r i (G) +
More informationCycle Double Covers and Semi-Kotzig Frame
Cycle Double Covers and Semi-Kotzig Frame Dong Ye and Cun-Quan Zhang arxiv:1105.5190v1 [math.co] 26 May 2011 Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310 Emails: dye@math.wvu.edu;
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationVertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,
More informationProper connection number and 2-proper connection number of a graph
Proper connection number and 2-proper connection number of a graph arxiv:1507.01426v2 [math.co] 10 Jul 2015 Fei Huang, Xueliang Li, Shujing Wang Center for Combinatorics and LPMC-TJKLC Nankai University,
More informationarxiv: v1 [math.co] 20 Sep 2014
On some papers of Nikiforov Bo Ning Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi an, Shaanxi 71007, P.R. China arxiv:109.588v1 [math.co] 0 Sep 01 Abstract
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationOn Generalized Ramsey Numbers
On Generalized Ramsey Numbers Wai Chee Shiu, Peter Che Bor Lam and Yusheng Li Abstract Let f 1 and f 2 be graph parameters. The Ramsey number rf 1 m; f 2 n is defined as the minimum integer N such that
More informationSpanning cycles in regular matroids without M (K 5 ) minors
Spanning cycles in regular matroids without M (K 5 ) minors Hong-Jian Lai, Bolian Liu, Yan Liu, Yehong Shao Abstract Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning
More informationFractional and circular 1-defective colorings of outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (05), Pages Fractional and circular -defective colorings of outerplanar graphs Zuzana Farkasová Roman Soták Institute of Mathematics Faculty of Science,
More informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
More informationHamilton cycles and closed trails in iterated line graphs
Hamilton cycles and closed trails in iterated line graphs Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 USA Iqbalunnisa, Ramanujan Institute University of Madras, Madras
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationOn the oriented chromatic index of oriented graphs
On the oriented chromatic index of oriented graphs Pascal Ochem, Alexandre Pinlou, Éric Sopena LaBRI, Université Bordeaux 1, 351, cours de la Libération 33405 Talence Cedex, France February 19, 2006 Abstract
More informationNotes on Graph Theory
Notes on Graph Theory Maris Ozols June 8, 2010 Contents 0.1 Berge s Lemma............................................ 2 0.2 König s Theorem........................................... 3 0.3 Hall s Theorem............................................
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationarxiv:math/ v1 [math.co] 17 Apr 2002
arxiv:math/0204222v1 [math.co] 17 Apr 2002 On Arithmetic Progressions of Cycle Lengths in Graphs Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences
More informationarxiv: v2 [math.co] 5 Nov 2015
Upper bounds for the achromatic and coloring numbers of a graph arxiv:1511.00537v2 [math.co] 5 Nov 2015 Baoyindureng Wu College of Mathematics and System Sciences, Xinjiang University Urumqi, Xinjiang
More informationEven Cycles in Hypergraphs.
Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and
More informationarxiv: v1 [math.co] 25 Dec 2017
Planar graphs without -cycles adjacent to triangles are DP--colorable Seog-Jin Kim and Xiaowei Yu arxiv:1712.08999v1 [math.co] 25 Dec 2017 December 27, 2017 Abstract DP-coloring (also known as correspondence
More informationON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS
Commun. Korean Math. Soc. 9 (014), No., pp. 359 366 http://dx.doi.org/10.4134/ckms.014.9..359 ON MINUS TOTAL DOMINATION OF DIRECTED GRAPHS WenSheng Li, Huaming Xing, and Moo Young Sohn Abstract. A three-valued
More informationINDUCED CYCLES AND CHROMATIC NUMBER
INDUCED CYCLES AND CHROMATIC NUMBER A.D. SCOTT DEPARTMENT OF MATHEMATICS UNIVERSITY COLLEGE, GOWER STREET, LONDON WC1E 6BT Abstract. We prove that, for any pair of integers k, l 1, there exists an integer
More informationNowhere 0 mod p dominating sets in multigraphs
Nowhere 0 mod p dominating sets in multigraphs Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel. e-mail: raphy@research.haifa.ac.il Abstract Let G be a graph with
More informationFactors in Graphs With Multiple Degree Constraints
Factors in Graphs With Multiple Degree Constraints Richard C. Brewster, Morten Hegner Nielsen, and Sean McGuinness Thompson Rivers University Kamloops, BC V2C0C8 Canada October 4, 2011 Abstract For a graph
More informationAcyclic and Oriented Chromatic Numbers of Graphs
Acyclic and Oriented Chromatic Numbers of Graphs A. V. Kostochka Novosibirsk State University 630090, Novosibirsk, Russia X. Zhu Dept. of Applied Mathematics National Sun Yat-Sen University Kaohsiung,
More information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
More informationDP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES
DP-4-COLORABILITY OF PLANAR GRAPHS WITHOUT GIVEN TWO ADJACENT CYCLES RUNRUN LIU 1 AND XIANGWEN LI 1 AND KITTIKORN NAKPRASIT 2 AND PONGPAT SITTITRAI 2 AND GEXIN YU 1,3 1 School of Mathematics & Statistics,
More informationHomomorphisms of sparse graphs to small graphs
LaBRI Université Bordeaux I France Graph Theory 2009 Fredericia, Denmark Thursday November 26 - Sunday November 29 Flow Let G be a directed graph, A be an abelian group. A-flow A-flow f of G is a mapping
More informationThe Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index
The Chvátal-Erdős condition for supereulerian graphs and the hamiltonian index Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 6506, U.S.A. Huiya Yan Department of Mathematics
More informationON SET-INDEXERS OF GRAPHS
Palestine Journal of Mathematics Vol. 3(2) (2014), 273 280 Palestine Polytechnic University-PPU 2014 ON SET-INDEXERS OF GRAPHS Ullas Thomas and Sunil C Mathew Communicated by Ayman Badawi MSC 2010 Classification:
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationNowhere-zero Unoriented Flows in Hamiltonian Graphs
Nowhere-zero Unoriented Flows in Hamiltonian Graphs S. Akbari 1,5, A. Daemi 2, O. Hatami 1, A. Javanmard 3, A. Mehrabian 4 1 Department of Mathematical Sciences Sharif University of Technology Tehran,
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationTHE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER
Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic
More informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationAntipodal Labelings for Cycles
Antipodal Labelings for Cycles Justie Su-Tzu Juan and Daphne Der-Fen Liu Submitted: December 2006; revised: August 2007 Abstract Let G be a graph with diameter d. An antipodal labeling of G is a function
More informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
More informationPreliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)}
Preliminaries Graphs G = (V, E), V : set of vertices E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) 1 2 3 5 4 V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} 1 Directed Graph (Digraph)
More informationTHE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2
LE MATEMATICHE Vol LXVIII (2013) Fasc II, pp 167 190 doi: 104418/201368213 THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2 K F BENSON - M PORTER - M TOMOVA A radio labeling of a simple connected
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More informationList-coloring the Square of a Subcubic Graph
List-coloring the Square of a Subcubic Graph Daniel W. Cranston University of Illinois Urbana-Champaign, USA Seog-Jin Kim Konkuk University Seoul, Korea February 1, 2007 Abstract The square G 2 of a graph
More informationSome results on the reduced power graph of a group
Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram
More informationOn Dominator Colorings in Graphs
On Dominator Colorings in Graphs Ralucca Michelle Gera Department of Applied Mathematics Naval Postgraduate School Monterey, CA 994, USA ABSTRACT Given a graph G, the dominator coloring problem seeks a
More informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationOn DP-coloring of graphs and multigraphs
On DP-coloring of graphs and multigraphs Anton Bernshteyn Alexandr Kostochka Sergei Pron arxiv:1609.00763v1 [math.co] 2 Sep 2016 Abstract While solving a question on list coloring of planar graphs, Dvořák
More informationImproved Upper Bounds for the Laplacian Spectral Radius of a Graph
Improved Upper Bounds for the Laplacian Spectral Radius of a Graph Tianfei Wang 1 1 School of Mathematics and Information Science Leshan Normal University, Leshan 614004, P.R. China 1 wangtf818@sina.com
More informationLecturer: Naoki Saito Scribe: Ashley Evans/Allen Xue. May 31, Graph Laplacians and Derivatives
MAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 19: Introduction to Spectral Graph Theory II. Graph Laplacians and Eigenvalues of Adjacency Matrices and Laplacians Lecturer:
More informationChromatic numbers of 6-regular graphs on the Klein bottle
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 45 (2009), Pages 73 85 Chromatic numbers of 6-regular graphs on the Klein bottle Atsuhiro Nakamoto Norihito Sasanuma Department of Mathematics Faculty of Education
More informationOn the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 30 2010 On the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices Xianya Geng Shuchao Li lscmath@mail.ccnu.edu.cn
More informationTree-width. September 14, 2015
Tree-width Zdeněk Dvořák September 14, 2015 A tree decomposition of a graph G is a pair (T, β), where β : V (T ) 2 V (G) assigns a bag β(n) to each vertex of T, such that for every v V (G), there exists
More informationOn the second Laplacian eigenvalues of trees of odd order
Linear Algebra and its Applications 419 2006) 475 485 www.elsevier.com/locate/laa On the second Laplacian eigenvalues of trees of odd order Jia-yu Shao, Li Zhang, Xi-ying Yuan Department of Applied Mathematics,
More information