X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
graph coloring (7) 7
graphs (3) 3
mathematics, applied (3) 3
maximum average degree (3) 3
star coloring (3) 3
list coloring (2) 2
mathematics (2) 2
star edge coloring (2) 2
star edge-coloring (2) 2
05c15 (1) 1
[formula omitted]-degenerate graph (1) 1
[formula omitted]-minor free graph (1) 1
cadmium (1) 1
cellulose triacetate membranes (1) 1
color (1) 1
coloring (1) 1
colorings (1) 1
combinatorics (1) 1
computer science (1) 1
copper (1) 1
crown-ether (1) 1
decision trees (1) 1
di phosphoric acid (1) 1
discrete mathematics (1) 1
edge coloring (1) 1
environmental sciences (1) 1
extraction (1) 1
facilitated transport (1) 1
incidence (1) 1
incidence chromatic number (1) 1
incidence coloring (1) 1
k (1) 1
k-4-minor free graph (1) 1
k-degenerate graph (1) 1
lead (1) 1
linear equations (1) 1
mathematics - combinatorics (1) 1
mediated transport (1) 1
minor free graph (1) 1
phosphoric-acid (1) 1
planar graphs (1) 1
polymer inclusion membranes (1) 1
separation (1) 1
slm (1) 1
star arboricity (1) 1
strong chromatic index (1) 1
studies (1) 1
tri-n-octylphosphine oxide (1) 1
zn ions (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, p. 268
A star edge-coloring of a graph G is a proper edge-coloring without 2-colored paths and cycles of length 4. For a graph G, let the list star chromatic index of... 
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 268 - 275
A star edge-coloring of a graph G is a proper edge-coloring without 2-colored paths and cycles of length 4. For a graph G, let the list star chromatic index of... 
List coloring | Star edge-coloring | [formula omitted]-degenerate graph | [formula omitted]-minor free graph
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2019, Volume 261, pp. 268 - 275
A star edge-coloring of a graph G is a proper edge-coloring without 2-colored paths and cycles of length 4. For a graph G, let the list star chromatic index of... 
List coloring | minor free graph | Star edge-coloring | K | k-degenerate graph | STRONG CHROMATIC INDEX | MATHEMATICS, APPLIED | K-4-minor free graph
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2018, Volume 238, pp. 115 - 125
A star-edge coloring of a graph G is a proper edge coloring such that every 2-colored connected subgraph of G is a path of length at most 3. For a graph G, let... 
Graph coloring | Star edge coloring | Star coloring | Maximum average degree | MATHEMATICS, APPLIED
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 11/2018, Volume 38, Issue 4, pp. 1037 - 1054
A star of a graph is a proper edge coloring such that every 2-colored connected subgraph of is a path of length at most 3. For a graph , let the of , ch′ (G),... 
graph coloring | edge coloring | star coloring | planar graphs | 05C15 | Graph coloring | Star coloring | Edge coloring | Planar graphs | MATHEMATICS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 07/2018, Volume 341, Issue 7, pp. 1835 - 1849
A star edge-coloring of a graph G is a proper edge coloring such that every 2-colored connected subgraph of G is a path of length at most 3. For a graph G, let... 
Graph coloring | Star edge coloring | Star coloring | Maximum average degree | COLORINGS | MATHEMATICS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, p. 268
A star edge-coloring of a graph G is a proper edge-coloring without 2-colored paths and cycles of length 4. For a graph G, let the list star chromatic index of... 
Graph coloring | Graphs | Decision trees
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
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2018, Volume 238, p. 115
A star-edge coloring of a graph G is a proper edge coloring such that every 2-colored connected subgraph of G is a path of length at most 3. For a graph G, let... 
Studies | Graph coloring | Graphs | Linear equations
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2017, Volume 227, p. 29
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... 
Coloring | Graph coloring | Color | Graphs | Combinatorics | Incidence
Journal Article
07/2019
The induced star arboricity (isa($G$)) of a graph $G$ is a new parameter introduced in 2019 by Axenovich et \textit{al.} \cite{axia2019}, it is defined as the... 
Mathematics - Combinatorics
Journal Article
Fresenius Environmental Bulletin, ISSN 1018-4619, 2009, Volume 18, Issue 11, pp. 2123 - 2130
Journal Article
12/2014
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... 
Journal Article
No results were found for your search.

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