X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
incidence (36) 36
mathematics (27) 27
humans (23) 23
index medicus (23) 23
graphs (21) 21
incidence coloring (20) 20
male (14) 14
optics (14) 14
female (13) 13
mathematics, applied (13) 13
star arboricity (13) 13
computer science (12) 12
incidence angle (12) 12
physics, applied (12) 12
coloring (10) 10
discrete mathematics (9) 9
instruments & instrumentation (9) 9
color (8) 8
discrete mathematics and combinatorics (8) 8
incidence chromatic number (8) 8
mathematical analysis (8) 8
physics (8) 8
combinatorics (7) 7
science (7) 7
aged (6) 6
design (6) 6
lenses (6) 6
macular degeneration (6) 6
middle aged (6) 6
multidisciplinary sciences (6) 6
number (6) 6
ophthalmology (6) 6
research article (6) 6
risk factors (6) 6
aged, 80 and over (5) 5
animals (5) 5
biology (5) 5
broadband (5) 5
cell biology (5) 5
child (5) 5
grazing incidence (5) 5
medicine (5) 5
medicine & public health (5) 5
polarization (5) 5
retrospective studies (5) 5
review (5) 5
studies (5) 5
surgery (5) 5
theoretical computer science (5) 5
adolescent (4) 4
adult (4) 4
age-related maculopathy (4) 4
algorithms (4) 4
antioxidants (4) 4
biochemistry & molecular biology (4) 4
cancer (4) 4
cataract (4) 4
child, preschool (4) 4
dietary supplements (4) 4
dynamics (4) 4
excitation (4) 4
eye diseases (4) 4
incidence coloring conjecture (4) 4
incidence game chromatic number (4) 4
laser (4) 4
lasers (4) 4
light (4) 4
maximum average degree (4) 4
mirrors (4) 4
oncology (4) 4
performance (4) 4
public health (4) 4
reflectance (4) 4
resolution (4) 4
sense organs (4) 4
treatment outcome (4) 4
5-year incidence (3) 3
94b05 (3) 3
age-related macular degeneration (3) 3
analysis (3) 3
applied mathematics (3) 3
blindness (3) 3
chemistry (3) 3
chemistry, multidisciplinary (3) 3
clinical trials (3) 3
complications (3) 3
convex and discrete geometry (3) 3
diet (3) 3
diffraction (3) 3
diffraction efficiency (3) 3
discrete mathematics in computer science (3) 3
disease progression (3) 3
energy (3) 3
eye disease (3) 3
fruits (3) 3
game chromatic number (3) 3
gene expression (3) 3
genetic structures (3) 3
health aspects (3) 3
incidence coloring number (3) 3
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Discrete Algorithms, ISSN 1570-8667, 03/2015, Volume 31, pp. 14 - 25
The incidence coloring game has been introduced in Andres (2009) [2] as a variation of the ordinary coloring game. The incidence game chromatic number ιg(G) of... 
Incidence game chromatic number | [formula omitted]-decomposable graphs | Incidence coloring game | Arboricity | Incidence coloring | Arboricity (a, d) -decomposable graphs | 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 Applied Mathematics, ISSN 0166-218X, 2009, Volume 157, Issue 9, pp. 1980 - 1987
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For k... 
Wheel | Incidence coloring number | Game chromatic number | Star | [formula omitted]-degenerate graph | Cycle | Game chromatic index | k-degenerate graph | MATHEMATICS, APPLIED | OUTERPLANAR GRAPHS | INDEX
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 315 - 327
An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w, f) are adjacent if v = w,... 
Cartesian product of cycles | incidence coloring | toroidal grid | Incidence coloring | Toroidal grid | MATHEMATICS | STAR ARBORICITY | CUBIC GRAPHS | INCIDENCE COLORING NUMBER | Computer Science | Discrete Mathematics
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 315 - 327
An incidence in a graph G is a pair (v, e) with v ∈ V (G) and e ∈ E(G), such that v and e are incident. Two incidences (v, e) and (w, f) are adjacent if v = w,... 
Cartesian product of cycles | incidence coloring | toroidal grid
Journal Article
Applied Optics, ISSN 1559-128X, 07/2018, Volume 57, Issue 19, p. 5281
In this paper, we present a detailed and rigorous study of cylindrical harmonic Fresnel lenses (HFLs) using the finite difference time domain method (FDTD) and... 
Diffraction efficiency | Fresnel lenses | Approximation | Broadband | Finite difference time domain method | Refractivity | Time domain analysis | Polarized light | Wavelengths | Diffraction | Mathematical analysis | Efficiency | Incidence angle
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2011, Volume 159, Issue 8, pp. 683 - 694
The incidence game chromatic number was introduced to unify the ideas of the incidence coloring number and the game chromatic number. We determine the exact... 
Incidence game chromatic number | Incidence coloring number | Game chromatic number | Paths | Wheels | MATHEMATICS, APPLIED | COLORING NUMBER | OUTERPLANAR GRAPHS | Coloring | Mathematical analysis | Games | Proving | Incidence
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2014, Volume 317, Issue 1, pp. 75 - 78
The strong chromatic index s′(G) of a multigraph G is the minimum integer k such that there is an edge-coloring of G with k colors in which every color class... 
Subdivision | Strong chromatic index | Incidence coloring | Strong edge-coloring | INDUCED MATCHINGS | SUBSET GRAPHS | MATHEMATICS | BIPARTITE GRAPHS | Integers | Matching | Graphs | Subdivisions | Joining | Mathematical analysis
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 2006, Volume 27, pp. 1 - 2
Journal Article
Qingdao Ligong Daxue Xuebao / Journal of Qingdao Technological University, ISSN 1673-4602, 08/2011, Volume 32, Issue 4, pp. 107 - 109
The fractional coloring is raised based on the ordinary coloring and it expands the research field of the graph coloring so as to better study the structures... 
Coloring | Gears | Stars | Graph colouring | Graphs | Incidence | Windmills
Journal Article
Qingdao Ligong Daxue Xuebao / Journal of Qingdao Technological University, ISSN 1673-4602, 08/2011, Volume 32, Issue 4, pp. 107 - 109
The fractional coloring is raised based on the ordinary coloring and it expands the research field of the graph coloring so as to better study the structures... 
Coloring | Gears | Graph coloring | Stars | Graphs | Windmills | Incidence
Journal Article
Beijing Daxue Xuebao (Ziran Kexue Ban)/Acta Scientiarum Naturalium Universitatis Pekinensis, ISSN 0479-8023, 09/2008, Volume 44, Issue 5, pp. 727 - 732
Journal Article
Discrete Mathematics, ISSN 0012-365X, 06/2019, Volume 342, Issue 6, pp. 1828 - 1837
An incidence of a graph G is a pair (u,e) where u is a vertex of G and e is an edge of G incident to u. Two incidences (u,e) and (v,f) of G are adjacent... 
Strong edge coloring | Cubic graph | Incidence coloring | Incidence choosability | MATHEMATICS | NUMBER | INCIDENCE COLORING CONJECTURE | STAR ARBORICITY | STRONG CHROMATIC INDEX
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
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 02/2020, Volume 40, Issue 1, pp. 345 - 354
An in a graph is a pair ( ) where is a vertex of and is an edge of incident to . Two incidences ( ) and ( ) are adjacent if at least one of the following... 
maximum average degree | incidence chromatic number | incidence coloring | planar graph | 05C15 | MATHEMATICS | STAR ARBORICITY | Computer Science | Discrete Mathematics | 05c15
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 07/2019, Volume 265, pp. 40 - 55
An incidence of a graph G is a pair (v,e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v,e) and (w,f) of G are adjacent... 
Incidence colouring | List colouring | Hamiltonian cubic graph | Incidence list colouring | Square grid | Halin graph | INCIDENCE CHROMATIC NUMBER | MATHEMATICS, APPLIED | INCIDENCE COLORING CONJECTURE | Coloring | Graphs | Mapping | Upper bounds | Incidence | Computer Science | Discrete Mathematics
Journal Article
Ars Combinatoria, ISSN 0381-7032, 07/2018, Volume 140, pp. 251 - 265
We study incidence coloring of graphs in which adjacent vertices are distinguished by their sets of the colors which assigned to their incidences and show that... 
Grids | Adjacent vertex distinguishing incidence coloring | Cylinders and tori | Adjacent vertex distinguishing incidence chromatic number | cylinders and tori | MATHEMATICS | grids | adjacent vertex distinguishing incidence chromatic number | GRAPHS
Journal Article
Discrete Mathematics and Theoretical Computer Science, ISSN 1365-8050, 2005, Volume 7, Issue 1, pp. 203 - 216
We prove that the incidence chromatic number of every 3-degenerated graph G is at most Delta(G)+ 4. It is known that the incidence chromatic number of every... 
K-degenerated graph | Planar graph | Incidence coloring | Maximum average degree | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS | MATHEMATICS, APPLIED | STAR ARBORICITY | k-degenerated graph | maximum average degree | incidence coloring | planar graph | Computer Science | Discrete Mathematics
Journal Article
Taiwanese Journal of Mathematics, ISSN 1027-5487, 2012, Volume 16, Issue 6, pp. 2289 - 2295
Using a relation between domination number and incidence chromatic number, we obtain necessary and sufficient conditions for r-regular graphs to be (r +... 
Incidence chromatic number | Complement graph | Domination number | Regular graph | MATHEMATICS | NUMBER | STAR ARBORICITY
Journal Article
No results were found for your search.

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