X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (17) 17
mathematics, applied (17) 17
mathematics - combinatorics (13) 13
computer science (12) 12
graphs (12) 12
discrete mathematics (8) 8
computer science, interdisciplinary applications (7) 7
combinatorics (6) 6
graph coloring (6) 6
mathematical analysis (6) 6
graph theory (5) 5
humans (5) 5
algorithms (4) 4
analysis (4) 4
coloring (4) 4
colorings (4) 4
evolution (4) 4
index medicus (4) 4
plane graph (4) 4
researchers (4) 4
upper bounds (4) 4
animals (3) 3
applied mathematics (3) 3
collaboration (3) 3
color (3) 3
discharging method (3) 3
discrete mathematics and combinatorics (3) 3
dynamics (3) 3
female (3) 3
information science & library science (3) 3
operations research/decision theory (3) 3
optimization (3) 3
planar graph (3) 3
research (3) 3
slowenien (3) 3
star chromatic index (3) 3
subcubic graph (3) 3
trees (3) 3
adult (2) 2
allergens (2) 2
allergens - immunology (2) 2
allergic reaction (2) 2
allergy (2) 2
antigenic determinants (2) 2
biochemistry & molecular biology (2) 2
care and treatment (2) 2
careers (2) 2
case studies (2) 2
chemistry, multidisciplinary (2) 2
chromatic number (2) 2
co-authorship (2) 2
complex systems (2) 2
computational geometry (2) 2
computer science - social and information networks (2) 2
convex and discrete geometry (2) 2
diagnosis, differential (2) 2
immunoglobulin e (2) 2
immunology (2) 2
immunotherapy (2) 2
incidence coloring (2) 2
information storage and retrieval (2) 2
injective coloring (2) 2
interdisciplinarity (2) 2
library science (2) 2
list star chromatic index (2) 2
list star edge-coloring (2) 2
mathematical modeling and industrial mathematics (2) 2
mathematics, interdisciplinary applications (2) 2
mimotopes (2) 2
network analysis (2) 2
networks (2) 2
number (2) 2
parity (2) 2
peptide library (2) 2
peptides (2) 2
physics (2) 2
physics - physics and society (2) 2
planar graphs (2) 2
plane graphs (2) 2
planes (2) 2
productivity (2) 2
produktivität (2) 2
research & development--r&d (2) 2
research performance (2) 2
science (2) 2
scientific collaboration (2) 2
social networks (2) 2
star arboricity (2) 2
studies (2) 2
surgery (2) 2
theory of computation (2) 2
vertex signature (2) 2
vertex-parity edge-coloring (2) 2
weak vertex-parity edge-coloring (2) 2
wiener index (2) 2
001.891 [udc] (1) 1
3-choosability (1) 1
3-colorability (1) 1
616.5:616.993 [udc] (1) 1
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Scientometrics, ISSN 0138-9130, 11/2018, Volume 117, Issue 2, pp. 1157 - 1182
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 11/2018, Volume 36, Issue 4, pp. 1425 - 1438
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2018, Volume 237, pp. 26 - 32
A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face α the maximal color appears exactly once on the vertices of α. If the... 
Facial unique-maximum coloring | Plane graph | Facial unique-maximum edge-coloring | COLORINGS | MATHEMATICS, APPLIED | PLANE GRAPHS | Mathematics - Combinatorics
Journal Article
Scientometrics, ISSN 0138-9130, 12/2016, Volume 109, Issue 3, pp. 1561 - 1578
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 03/2019, Volume 90, Issue 3, pp. 304 - 310
A star edge‐coloring of a graph is a proper edge‐coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of... 
list star chromatic index | subcubic graph | list star edge‐coloring | star chromatic index | list star edge-coloring | MATHEMATICS | Mathematics - Combinatorics
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 2/2018, Volume 35, Issue 2, pp. 373 - 388
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 11/2017, Volume 312, pp. 202 - 213
We prove a conjecture of Nadjafi-Arani et al. on the difference between the Szeged and the Wiener index of a graph (Nadjafi-Aranifi et al., 2012). Namely, if G... 
Wiener index | Revised Szeged index | Szeged–Wiener relation | Szeged index | MATHEMATICS, APPLIED | DISTANCE | Szeged-Wiener relation | GRAPHS | Mathematics - Combinatorics | Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 07/2017, Volume 34, Issue 1, pp. 174 - 181
An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at... 
Incidence chromatic number | Subquartic graph | Incidence coloring | MATHEMATICS, APPLIED | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | INCIDENCE COLORING CONJECTURE | STAR ARBORICITY | Computer science
Journal Article
Discrete Mathematics, ISSN 0012-365X, 10/2013, Volume 313, Issue 20, pp. 2218 - 2222
A facial parity edge coloring of a 2-edge connected plane graph is an edge coloring where no two consecutive edges of a facial trail of any face receive the... 
Facial parity edge coloring | Plane graph | Odd graph | MATHEMATICS | Coloring | Planes | Facial | Mathematical analysis | Color | Graphs | Parity | Mathematics - Combinatorics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 06/2014, Volume 324, Issue 1, pp. 41 - 49
A strong edge-coloring of a graph is a proper edge-coloring where the edges at distance at most 2 receive distinct colors. It is known that every planar graph... 
Discharging method | Strong chromatic index | Planar graph | Strong edge-coloring | INDUCED MATCHINGS | MATHEMATICS | SUBCUBIC GRAPHS | Mathematical analysis | Graphs | Mathematics - Combinatorics
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 01/2016, Volume 81, Issue 1, pp. 73 - 82
A star edge coloring of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this article, we establish tight upper bounds... 
star edge coloring | star chromatic index | MATHEMATICS | PLANAR GRAPHS | Mathematics - Combinatorics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2015, Volume 181, pp. 160 - 166
The well-known Randić index of a graph G is defined as R(G)=∑( · )-1/2, where the sum is taken over all edges uv∈E(G) and and denote the degrees of u and v,... 
Index | Branching index | Randić index | Connectivity index | ORDER | MATHEMATICS, APPLIED | Randic index | TREES | Index R | Index IR | GRAPHS | Trees | Lower bounds | Real numbers | Upper bounds | Mathematical analysis | Paper | Graphs | Graph theory
Journal Article
Journal Article
Journal of Global Optimization, ISSN 0925-5001, 12/2014, Volume 60, Issue 4, pp. 793 - 799
The coloring of disk graphs is motivated by the frequency assignment problem. In 1998, Malesińska et al. introduced double disk graphs as their generalization.... 
Double disk graph | Frequency assignment problem | Operations Research/Decision Theory | Disk graph | Computer Science, general | Chromatic number | Optimization | Economics / Management Science | Real Functions | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHMS | Studies | Disks | Wireless networks
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2019
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 08/2017, Volume 61, pp. 835 - 839
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. We consider the list version of this coloring... 
list star chromatic index | subcubic graph | List star edge-coloring | star chromatic index
Journal Article
No results were found for your search.

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