X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (138) 138
Publication (20) 20
Book Chapter (4) 4
Magazine Article (3) 3
Book Review (1) 1
Conference Proceeding (1) 1
Dissertation (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
strong chromatic index (81) 81
mathematics (76) 76
graphs (43) 43
mathematics, applied (39) 39
strong edge-coloring (24) 24
induced matching (23) 23
induced matchings (18) 18
computer science (17) 17
graph theory (16) 16
mathematical analysis (16) 16
strong edge coloring (15) 15
combinatorics (14) 14
algorithms (13) 13
discrete mathematics and combinatorics (12) 12
coloring (11) 11
discrete mathematics (11) 11
color (10) 10
edge coloring (10) 10
matching (10) 10
subcubic graphs (10) 10
mathematics - combinatorics (9) 9
planar graphs (9) 9
theoretical computer science (9) 9
05c15 (8) 8
maximum average degree (8) 8
planar graph (8) 8
upper bounds (8) 8
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (7) 7
adjacent strong chromatic index (7) 7
astrophysics (7) 7
bipartite graphs (7) 7
cosmology and extragalactic astrophysics (7) 7
galaxy astrophysics (7) 7
physics (7) 7
strong edge colouring (7) 7
strong matching (7) 7
applied mathematics (6) 6
astronomy & astrophysics (6) 6
combinatorial nullstellensatz (6) 6
engineering design (6) 6
irregularity strength (6) 6
optimization (6) 6
astrophysics - cosmology and nongalactic astrophysics (5) 5
colour (5) 5
complexity (5) 5
computer science - discrete mathematics (5) 5
convex and discrete geometry (5) 5
discharging method (5) 5
girth (5) 5
graph coloring (5) 5
number (5) 5
optics (5) 5
strong edge-colouring (5) 5
theory of computation (5) 5
trees (5) 5
analysis (4) 4
chromatic index (4) 4
computer science, information systems (4) 4
computer science, interdisciplinary applications (4) 4
gravitational lensing: strong (4) 4
halin graph (4) 4
halin graphs (4) 4
integers (4) 4
joining (4) 4
k-degenerate graphs (4) 4
mathematical modeling and industrial mathematics (4) 4
neighbour sum distinguishing index (4) 4
quasars (4) 4
strong product (4) 4
subset graphs (4) 4
05c78 (3) 3
apexes (3) 3
astrophysics, cosmology and astronomy (3) 3
bipartite graph (3) 3
colouring (3) 3
combinatorial analysis (3) 3
combinatorial problems (3) 3
cubic graphs (3) 3
edge-coloring (3) 3
graph (3) 3
gravitational lenses (3) 3
images (3) 3
line graph (3) 3
lists (3) 3
map (3) 3
mathematics, interdisciplinary applications (3) 3
maximum induced matchings (3) 3
music (3) 3
np-completeness (3) 3
operation research/decision theory (3) 3
outerplanar graphs (3) 3
physics - cosmology and nongalactic astrophysics (3) 3
physics, multidisciplinary (3) 3
quantum physics (3) 3
random graphs (3) 3
research (3) 3
sparse graphs (3) 3
telecommunications (3) 3
theoretical, mathematical and computational physics (3) 3
1-2-3 conjecture (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Applied Mathematics and Computation, ISSN 0096-3003, 09/2018, Volume 333, pp. 480 - 489
The star chromatic index χ (G) of a graph G is the smallest integer k for which G has a proper edge k-coloring without bichromatic paths or cycles of length... 
Edge-partition | Star chromatic index | Outerplanar graph | Strong chromatic index | Planar graph | Business schools
Journal Article
Discrete Mathematics, ISSN 0012-365X, 12/2018, Volume 341, Issue 12, pp. 3434 - 3440
A strong k-edge-coloring of a graph G is an edge-coloring with k colors in which every color class is an induced matching. The strong chromatic index of G,... 
Strong list-chromatic index | Subcubic graphs | Combinatorial nullstellensatz | MATHEMATICS | CHOOSABILITY
Journal Article
Discrete Mathematics, ISSN 0012-365X, 05/2017, Volume 340, Issue 5, pp. 1143 - 1149
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. We study bipartite graphs with one part having maximum... 
Induced matching | Bipartite graph | Strong edge-coloring | MATHEMATICS
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 04/2019, Volume 90, Issue 4, pp. 523 - 534
The strong chromatic index of a graph G, denoted by s ′ ( G ), is defined as the least number of colors in a coloring of edges of G, such that each color class... 
unit distance graph | strong chromatic index | strong clique | MATHEMATICS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 07/2017, Volume 340, Issue 7, pp. 1508 - 1513
The strong chromatic index of a graph G, denoted by s′(G), is the minimum possible number of colors in a coloring of the edges of G such that each color class... 
Fractional coloring | Strong chromatic index | Bipartite graph | INDUCED MATCHINGS | MATHEMATICS
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 12/2016, Volume 83, Issue 4, pp. 334 - 339
A coloring of the edges of a graph G is strong if each color class is an induced matching of G. The strong chromatic index of G, denoted by χs′(G), is the... 
strong chromatic index | coloring number | maximum average degree of a graph | line graph | MATHEMATICS | K-DEGENERATE GRAPHS | NUMBER | GAMES
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 03/2018, Volume 321, pp. 431 - 441
A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are adjacent to a... 
Generalized Petersen graphs | Strong chromatic index | Strong edge coloring | INDUCED MATCHINGS | MATHEMATICS, APPLIED | DOMINATION NUMBER | CUBIC HALIN GRAPHS | P(N
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 06/2013, Volume 73, Issue 2, pp. 119 - 126
We prove that the strong chromatic index of a 2‐degenerate graph is linear in the maximum degree Δ. This includes the class of all chordless graphs (graphs in... 
block line critical graph | 2‐degenerate graph | strong chromatic index | chordless graph | edge coloring | induced matching | 2-degenerate graph | MATHEMATICS | BIPARTITE GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 09/2014, Volume 330, pp. 17 - 19
A strong edge coloring of a graph G is a proper edge coloring in which every color class is an induced matching. The strong chromatic indexχs′(G) of a graph G... 
Chordless graph | [formula omitted]-degenerate graph | Minimally 2-connected graph | Strong chromatic index | k-degenerate graph | MATHEMATICS
Journal Article
Information Processing Letters, ISSN 0020-0190, 02/2015, Volume 115, Issue 2, pp. 326 - 330
•We investigate an upper bound on the strong chromatic index of graphs.•We confirm the conjecture of Chang and Narayanan.•Strong chromatic index of... 
Combinatorial problems | Strong chromatic index | Sparse graphs | Strong edge-coloring | COMPUTER SCIENCE, INFORMATION SYSTEMS | Computer science | Coloring | Matching | Upper bounds | Lists | Color | Data processing | Graphs
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 07/2019, Volume 91, Issue 3, pp. 251 - 258
Golumbic, Hirst, and Lewenstein define a matching in a simple, finite, and undirected graph G to be uniquely restricted if no other matching covers exactly the... 
acyclic chromatic index | strong chromatic index | uniquely restricted matching | edge‐coloring | chromatic index | edge-coloring | GRAPH | MATHEMATICS | ACYCLIC EDGE COLORINGS | Mathematics | Computer Science
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 08/2018, Volume 25, Issue 3
A strong edge-coloring of a graph G is a coloring of the edges such that every color class induces a matching in G. The strong chromatic index of a graph is... 
Induced matching | Strong edge-coloring | INDUCED MATCHINGS | MATHEMATICS | MATHEMATICS, APPLIED | SUBCUBIC GRAPHS | STRONG EDGE-COLORINGS
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 09/2015, Volume 80, Issue 1, pp. 58 - 68
A strong edge coloring of a graph is an assignment of colors to the edges of the graph such that for every color, the set of edges that are given that color... 
strong chromatic index | strong edge coloring | chordless graphs | induced matching | MATHEMATICS
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 07/2018, Volume 25, Issue 3
The strong chromatic index of a graph G, denoted (')(X)(G),is the least number of colors needed to edge-color G so that edges at distance at most two receive... 
Strong chromatic index | Strong edge coloring | Sparse graphs | MATHEMATICS | PLANAR GRAPHS | MATHEMATICS, APPLIED | SUBCUBIC GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 05/2012, Volume 312, Issue 9, pp. 1536 - 1541
A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if their distance is at... 
Strong chromatic index | Strong edge coloring | Halin graph | INDUCED MATCHINGS | MATHEMATICS | Trees | Coloring | Construction | Planes | Mathematical analysis | Wheels | Graphs | Joining
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2018, Volume 247, pp. 389 - 397
A strongk-edge-coloring of a graph G is a mapping from E(G) to {1,2,…,k} such that every pair of distinct edges at distance at most two receive different... 
Strong chromatic index | Girth | Planar graph | COLORINGS | K-DEGENERATE GRAPHS | MATHEMATICS, APPLIED | CUBIC HALIN GRAPHS | WIRELESS NETWORKS | ALGORITHMS | MAP | CHANNEL ASSIGNMENT
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2015, Volume 49, pp. 277 - 284
We prove χs′(G)≤1.93Δ(G)2 for graphs of sufficiently large maximum degree where χs′(G) is the strong chromatic index of G. This improves an old bound of Molloy... 
Strong chromatic index | Maximum Degree | Edge coloring
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2018, Volume 38, Issue 1, pp. 5 - 26
The strong chromatic index of a graph , denoted by χ′ ), is the minimum number of vertex induced matchings needed to partition the edge set of . Let be a tree... 
strong edge-coloring | strong chromatic index | Halin graphs | 05C15 | Strong chromatic index | Strong edge-coloring | INDUCED MATCHINGS | MATHEMATICS | PLANAR GRAPHS | Hann graphs
Journal Article
Discrete Mathematics, ISSN 0012-365X, 10/2013, Volume 313, Issue 19, pp. 2000 - 2006
Let φ:E→{1,2,…,k} be a proper edge coloring of a graph G=(V,E). The set of colors of edges incident to a vertex v∈V is called the color set of v and denoted by... 
Circulant graph | Vertex-distinguishing coloring | [formula omitted]-strong chromatic index | D-strong chromatic index | MATHEMATICS | d-strong chromatic index | OBSERVABILITY | PROPER EDGE-COLORINGS | GRAPHS
Journal Article
Applied Mathematics Letters, ISSN 0893-9659, 05/2012, Volume 25, Issue 5, pp. 898 - 901
A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if they are incident to a... 
Strong chromatic index | Strong edge coloring | Halin graph | INDUCED MATCHINGS | MATHEMATICS, APPLIED | Coloring | Trees | Leaves | Construction | Planes | Mathematical analysis | Graphs | Joining
Journal Article
No results were found for your search.

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