Discrete Applied Mathematics, ISSN 0166-218X, 03/2014, Volume 166, pp. 84 - 90

A proper [k]-edge coloring of a graph G is a proper edge coloring of G using colors of the set [k], where [k]={1,2,.,k}. A neighbor sum distinguishing [k]-edge...

Proper colorings | Neighbor sum distinguishing edge colorings | Maximum average degree

Proper colorings | Neighbor sum distinguishing edge colorings | Maximum average degree

Journal Article

Discrete Mathematics, ISSN 0012-365X, 02/2014, Volume 317, Issue 1, pp. 19 - 32

For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that...

2-distance coloring | Square coloring | Maximum average degree | MATHEMATICS | PLANAR GRAPHS | GIRTH 6 | Mathematics | Combinatorics | Computer Science | Discrete Mathematics

2-distance coloring | Square coloring | Maximum average degree | MATHEMATICS | PLANAR GRAPHS | GIRTH 6 | Mathematics | Combinatorics | Computer Science | Discrete Mathematics

Journal Article

Discrete Mathematics, ISSN 0012-365X, 10/2017, Volume 340, Issue 10, pp. 2528 - 2530

We say a graph is (d,d,…,d,0,…,0)-colorable with a of d’s and b of 0’s if V(G) may be partitioned into b independent sets O1,O2,…,Ob and a sets D1,D2,…,Da...

Global discharging | Relaxed coloring | Maximum average degree | MATHEMATICS

Global discharging | Relaxed coloring | Maximum average degree | MATHEMATICS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 05/2018, Volume 341, Issue 5, pp. 1406 - 1418

An r-dynamic k-coloring of a graph G is a proper k-coloring such that for any vertex v, there are at least min{r,degG(v)} distinct colors in NG(v). The...

Dynamic coloring | List 3-dynamic coloring | Maximum average degree | MATHEMATICS | SQUARE | PLANAR GRAPHS | GIRTH

Dynamic coloring | List 3-dynamic coloring | Maximum average degree | MATHEMATICS | SQUARE | PLANAR GRAPHS | GIRTH

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 08/2017, Volume 227, pp. 29 - 43

An incidence of an undirected graph G is a pair (v,e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v,e) and (w,f) are adjacent...

Graph coloring | Incidence chromatic number | Incidence coloring | Maximum average degree | MATHEMATICS, APPLIED | STAR ARBORICITY

Graph coloring | Incidence chromatic number | Incidence coloring | Maximum average degree | MATHEMATICS, APPLIED | STAR ARBORICITY

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 217, pp. 663 - 672

The well known 1–2–3-Conjecture asserts that every connected graph G of order at least three can be edge-coloured with integers 1,2,3 so that the sums of...

Combinatorial Nullstellensatz | 1–2–3 Conjecture | 1–2-Conjecture | [formula omitted]-edge-weight choosability | [formula omitted]-total weight choosability | Discharging method | Maximum average degree | 2-total weight choosability | 3-edge-weight choosability | 1-2-3 Conjecture | MATHEMATICS, APPLIED | IRREGULARITY STRENGTH | 1-2-Conjecture

Combinatorial Nullstellensatz | 1–2–3 Conjecture | 1–2-Conjecture | [formula omitted]-edge-weight choosability | [formula omitted]-total weight choosability | Discharging method | Maximum average degree | 2-total weight choosability | 3-edge-weight choosability | 1-2-3 Conjecture | MATHEMATICS, APPLIED | IRREGULARITY STRENGTH | 1-2-Conjecture

Journal Article

数学学报：英文版, ISSN 1439-8516, 2018, Volume 34, Issue 2, pp. 265 - 274

Let G be a graph and let its maxiraum degree and maximum average degree be denoted by △（G） and mad（G）, respectively. A neighbor sum distinguishing k-edge...

MATHEMATICS | MATHEMATICS, APPLIED | Neighbor sum distinguishing coloring | maximum average degree | PLANAR GRAPHS | DISTINGUISHING INDEX | DISTINGUISHING EDGE-COLORINGS | combinatorial nullstellensatz | proper colorings | Mathematical analysis | Graph theory | Graph coloring

MATHEMATICS | MATHEMATICS, APPLIED | Neighbor sum distinguishing coloring | maximum average degree | PLANAR GRAPHS | DISTINGUISHING INDEX | DISTINGUISHING EDGE-COLORINGS | combinatorial nullstellensatz | proper colorings | Mathematical analysis | Graph theory | Graph coloring

Journal Article

Discrete Applied Mathematics, ISSN 0166-218X, 04/2019, Volume 258, pp. 254 - 263

An r-dynamick-coloring of a graphG is a proper k-coloring such that every vertex v in V(G) has neighbors in at least min{d(v),r} different classes. The...

[formula omitted]-dynamic coloring | List [formula omitted]-dynamic coloring | Maximum average degree | List r-dynamic coloring | r-dynamic coloring | MATHEMATICS, APPLIED | Coloring

[formula omitted]-dynamic coloring | List [formula omitted]-dynamic coloring | Maximum average degree | List r-dynamic coloring | r-dynamic coloring | MATHEMATICS, APPLIED | Coloring

Journal Article

Discrete Mathematics, ISSN 0012-365X, 10/2018, Volume 341, Issue 10, pp. 2661 - 2671

The well known 1–2–3-Conjecture asserts that every connected graph G with at least three vertices can be edge weighted with 1,2,3, so that for any two adjacent...

Combinatorial Nullstellensatz | choosable graphs | 1–2–3 conjecture | Total weighting | k,k | Maximum average degree

Combinatorial Nullstellensatz | choosable graphs | 1–2–3 conjecture | Total weighting | k,k | Maximum average degree

Journal Article

Discrete Mathematics, ISSN 0012-365X, 10/2018, Volume 341, Issue 10, pp. 2661 - 2671

The well known 1–2–3-Conjecture asserts that every connected graph G with at least three vertices can be edge weighted with 1,2,3, so that for any two adjacent...

Combinatorial Nullstellensatz | [formula omitted]-choosable graphs | 1–2–3 conjecture | Total weighting | Maximum average degree

Combinatorial Nullstellensatz | [formula omitted]-choosable graphs | 1–2–3 conjecture | Total weighting | Maximum average degree

Journal Article

11.
Full Text
Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree

Discrete Applied Mathematics, ISSN 0166-218X, 03/2014, Volume 166, pp. 84 - 90

A proper [k]-edge coloring of a graph G is a proper edge coloring of G using colors of the set [k], where [k]={1,2,…,k}. A neighbor sum distinguishing [k]-edge...

Proper colorings | Neighbor sum distinguishing edge colorings | Maximum average degree | MATHEMATICS, APPLIED | DISTINGUISHING INDEX | Coloring | Mathematical analysis | Graphs

Proper colorings | Neighbor sum distinguishing edge colorings | Maximum average degree | MATHEMATICS, APPLIED | DISTINGUISHING INDEX | Coloring | Mathematical analysis | Graphs

Journal Article

Algorithmica, ISSN 0178-4617, 7/2011, Volume 60, Issue 3, pp. 553 - 568

Let mad (G) denote the maximum average degree (over all subgraphs) of G and let χ i (G) denote the injective chromatic number of G. We prove that if Δ≥4 and...

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | List coloring | Theory of Computation | Discharging method | Algorithm Analysis and Problem Complexity | Injective coloring | Maximum average degree | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | SQUARE | THEOREM | PLANAR GRAPHS | CHROMATIC NUMBER

Computer Systems Organization and Communication Networks | Data Structures, Cryptology and Information Theory | Algorithms | Mathematics of Computing | Computer Science | List coloring | Theory of Computation | Discharging method | Algorithm Analysis and Problem Complexity | Injective coloring | Maximum average degree | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | SQUARE | THEOREM | PLANAR GRAPHS | CHROMATIC NUMBER

Journal Article

Discrete Mathematics, ISSN 0012-365X, 04/2016, Volume 339, Issue 4, pp. 1251 - 1260

The square G2 of a graph G is the graph defined on V(G) such that two vertices u and v are adjacent in G2 if the distance between u and v in G is at most 2....

Coloring | Square coloring | Maximum average degree | MATHEMATICS | PLANAR GRAPHS | SPARSE GRAPHS | GIRTH | Integers | Constants | Graphs | Graph theory | Mathematical analysis

Coloring | Square coloring | Maximum average degree | MATHEMATICS | PLANAR GRAPHS | SPARSE GRAPHS | GIRTH | Integers | Constants | Graphs | Graph theory | Mathematical analysis

Journal Article

Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 03/2013, Volume 33, Issue 1, pp. 91 - 99

A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct...

maximum average degree | acyclic colouring | bounded degree graph | Acyclic colouring | Bounded degree graph | Maximum average degree | COLORINGS | MATHEMATICS | PLANAR GRAPHS

maximum average degree | acyclic colouring | bounded degree graph | Acyclic colouring | Bounded degree graph | Maximum average degree | COLORINGS | MATHEMATICS | PLANAR GRAPHS

Journal Article

Discrete Mathematics, ISSN 0012-365X, 05/2018, Volume 341, Issue 5, pp. 1244 - 1252

For integers k,r>0, a (k,r)-coloring of a graph G is a proper coloring c with at most k colors such that for any vertex v with degree d(v), there are at least...

[formula omitted]-hued chromatic number | List ([formula omitted])-coloring | Square coloring | ([formula omitted])-coloring | Maximum average degree | r-hued chromatic number | List (k,r)-coloring | (k,r)-coloring | MATHEMATICS | (k, r)-coloring | PLANAR GRAPHS | List (k, r)-coloring | GIRTH

[formula omitted]-hued chromatic number | List ([formula omitted])-coloring | Square coloring | ([formula omitted])-coloring | Maximum average degree | r-hued chromatic number | List (k,r)-coloring | (k,r)-coloring | MATHEMATICS | (k, r)-coloring | PLANAR GRAPHS | List (k, r)-coloring | GIRTH

Journal Article

Advances in Meteorology, ISSN 1687-9309, 2016, Volume 2016, pp. 1 - 13

Gathering very accurate spatially explicit data related to the distribution of mean annual precipitation is required when laying the groundwork for the...

SWEDEN | BAYESIAN MAXIMUM-ENTROPY | METEOROLOGY & ATMOSPHERIC SCIENCES | SEA | Bayesian statistical decision theory | Multivariate analysis | Precipitation (Meteorology) | Comparative analysis

SWEDEN | BAYESIAN MAXIMUM-ENTROPY | METEOROLOGY & ATMOSPHERIC SCIENCES | SEA | Bayesian statistical decision theory | Multivariate analysis | Precipitation (Meteorology) | Comparative analysis

Journal Article

17.
Full Text
Neighbor sum distinguishing colorings of graphs with maximum average degree less than 3712

Acta Mathematica Sinica, English Series, ISSN 1439-8516, 02/2018, Volume 34, Issue 2, pp. 265 - 274

Journal Article

18.
Full Text
On the Neighbour Sum Distinguishing Index of Graphs with Bounded Maximum Average Degree

Graphs and Combinatorics, ISSN 0911-0119, 11/2017, Volume 33, Issue 6, pp. 1459 - 1471

A proper edge k-colouring of a graph $$G=(V,E)$$ G = ( V , E ) is an assignment $$c:E\rightarrow \{1,2,\ldots ,k\}$$ c : E → { 1 , 2 , … , k } of colours to...

05C78 | Neighbour sum distinguishing index | Mathematics | Engineering Design | Discharging method | Combinatorics | Maximum average degree | 05C15 | MATHEMATICS | IRREGULARITY STRENGTH | DISTINGUISHING EDGE COLORINGS | Mathematics - Combinatorics

05C78 | Neighbour sum distinguishing index | Mathematics | Engineering Design | Discharging method | Combinatorics | Maximum average degree | 05C15 | MATHEMATICS | IRREGULARITY STRENGTH | DISTINGUISHING EDGE COLORINGS | Mathematics - Combinatorics

Journal Article

19.
Full Text
Equitable Coloring and Equitable Choosability of Graphs with Small Maximum Average Degree

Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 08/2018, Volume 38, Issue 3, pp. 829 - 839

A graph is said to be equitably -colorable if the vertex set ( ) can be partitioned into independent subsets , , . . . , such that || |−| || ≤ 1 (1 ≤ ≤ ). A...

maximum average degree | graph coloring | equitable choosability | 05C15 | 7-CYCLES | MATHEMATICS | SHORT CYCLES | PLANAR GRAPHS | LIST COLORINGS

maximum average degree | graph coloring | equitable choosability | 05C15 | 7-CYCLES | MATHEMATICS | SHORT CYCLES | PLANAR GRAPHS | LIST COLORINGS

Journal Article

Acta Mathematica Sinica, English Series, ISSN 1439-8516, 2/2018, Volume 34, Issue 2, pp. 265 - 274

Let G be a graph and let its maximum degree and maximum average degree be denoted by Δ(G) and mad(G), respectively. A neighbor sum distinguishing k-edge...

Neighbor sum distinguishing coloring | maximum average degree | Mathematics, general | Mathematics | combinatorial nullstellensatz | proper colorings | 05C15

Neighbor sum distinguishing coloring | maximum average degree | Mathematics, general | Mathematics | combinatorial nullstellensatz | proper colorings | 05C15

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.