X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (17184) 17184
Publication (1798) 1798
Book Chapter (313) 313
Conference Proceeding (300) 300
Book Review (71) 71
Newspaper Article (28) 28
Dissertation (26) 26
Magazine Article (17) 17
Paper (14) 14
Book / eBook (12) 12
Government Document (10) 10
Reference (9) 9
Technical Report (3) 3
Report (2) 2
Trade Publication Article (2) 2
Data Set (1) 1
Electronic Resource (1) 1
Newsletter (1) 1
Streaming Video (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
index medicus (4114) 4114
analysis (3129) 3129
humans (2968) 2968
maximum-likelihood (2438) 2438
studies (1886) 1886
algorithms (1839) 1839
male (1747) 1747
models (1721) 1721
research (1677) 1677
computer simulation (1645) 1645
animals (1635) 1635
statistics & probability (1622) 1622
maximum likelihood estimation (1535) 1535
female (1478) 1478
phylogeny (1448) 1448
mathematical models (1325) 1325
ecology (1290) 1290
evolution (1215) 1215
evolutionary biology (1205) 1205
adult (1148) 1148
research article (1143) 1143
climate change (1126) 1126
temperature (1126) 1126
meteorology & atmospheric sciences (1036) 1036
last glacial maximum (1020) 1020
multidisciplinary sciences (982) 982
geosciences, multidisciplinary (913) 913
science (902) 902
climate (901) 901
medicine (846) 846
statistical analysis (846) 846
economic models (845) 845
statistics (837) 837
environmental sciences (836) 836
model (820) 820
biology (796) 796
methods (789) 789
genetics & heredity (773) 773
maximum-likelihood-estimation (772) 772
usage (731) 731
life sciences (722) 722
maximum (710) 710
precipitation (703) 703
simulation (684) 684
middle aged (681) 681
physiology (673) 673
phylogenetics (671) 671
maximum likelihood (656) 656
regression analysis (652) 652
earth sciences (651) 651
sport sciences (622) 622
economics (618) 618
evolution, molecular (614) 614
mathematics, interdisciplinary applications (614) 614
mathematics (612) 612
optimization (600) 600
physiological aspects (589) 589
maximum entropy (586) 586
maximum likelihood method (582) 582
genetics (579) 579
likelihood functions (572) 572
inference (570) 570
genes (568) 568
social sciences, mathematical methods (567) 567
entropy (559) 559
article (558) 558
exercise (543) 543
mathematical analysis (541) 541
performance (533) 533
oceanography (532) 532
engineering, electrical & electronic (531) 531
variability (529) 529
genomics (527) 527
estimators (525) 525
parameter estimation (525) 525
engineering (512) 512
bayesian analysis (510) 510
genetic aspects (509) 509
genomes (507) 507
modeling (501) 501
genetic variation (492) 492
physics (480) 480
trends (476) 476
aged (474) 474
proteins (463) 463
mathematical & computational biology (460) 460
plant sciences (460) 460
computer science (459) 459
population genetics (453) 453
climate-change (447) 447
rainfall (443) 443
biochemistry & molecular biology (441) 441
biodiversity (436) 436
regression (433) 433
models, statistical (432) 432
molecular sequence data (431) 431
zoology (425) 425
parameters (422) 422
temperature effects (418) 418
microbiology (416) 416
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (17728) 17728
Japanese (50) 50
French (34) 34
Chinese (14) 14
German (12) 12
Russian (5) 5
Spanish (5) 5
Polish (4) 4
Italian (2) 2
Korean (2) 2
Lithuanian (2) 2
Czech (1) 1
Dutch (1) 1
Norwegian (1) 1
Persian (1) 1
Portuguese (1) 1
Ukrainian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
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
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
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
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, 01/2017, Volume 217, pp. 663 - 672
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
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
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
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
Journal Article
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
Journal Article
Algorithmica, ISSN 0178-4617, 7/2011, Volume 60, Issue 3, pp. 553 - 568
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
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
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
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
Journal Article
Acta Mathematica Sinica, English Series, ISSN 1439-8516, 02/2018, Volume 34, Issue 2, pp. 265 - 274
Journal Article
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
Journal Article
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
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
Journal Article
No results were found for your search.

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