X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (14011) 14011
Conference Proceeding (1511) 1511
Publication (1423) 1423
Book / eBook (498) 498
Newspaper Article (311) 311
Dissertation (195) 195
Book Chapter (179) 179
Paper (57) 57
Magazine Article (33) 33
Book Review (28) 28
Web Resource (24) 24
Government Document (7) 7
Trade Publication Article (7) 7
Reference (6) 6
Newsletter (3) 3
Presentation (2) 2
Archival Material (1) 1
Data Set (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (6322) 6322
graphs (5360) 5360
algorithms (3146) 3146
mathematics, applied (3072) 3072
graph theory (2899) 2899
graph coloring (2452) 2452
computer science (2441) 2441
combinatorics (1607) 1607
coloring (1481) 1481
computer science, theory & methods (1463) 1463
mathematical analysis (1356) 1356
theoretical computer science (1066) 1066
discrete mathematics and combinatorics (1059) 1059
graph (992) 992
optimization (977) 977
studies (967) 967
analysis (915) 915
chromatic number (831) 831
mathematics - combinatorics (824) 824
combinatorial analysis (812) 812
color (777) 777
discrete mathematics (723) 723
complexity (722) 722
computer science, software engineering (713) 713
planar graphs (671) 671
computer science, information systems (666) 666
theory of computation (639) 639
mathematical models (565) 565
operations research & management science (546) 546
planar graph (545) 545
applied mathematics (538) 538
algorithm (530) 530
trees (498) 498
research (460) 460
mathematics, general (451) 451
networks (449) 449
integers (448) 448
number (443) 443
computational theory and mathematics (421) 421
computer science, interdisciplinary applications (420) 420
polynomials (411) 411
graph algorithms (408) 408
engineering, electrical & electronic (405) 405
05c15 (398) 398
engineering design (392) 392
computational complexity (390) 390
algebra (374) 374
colorings (369) 369
computer science, hardware & architecture (358) 358
convex and discrete geometry (358) 358
graphentheorie (355) 355
computation (340) 340
algorithm analysis and problem complexity (301) 301
operations research/decision theory (295) 295
computer science, artificial intelligence (294) 294
statistics & probability (291) 291
computer science - discrete mathematics (289) 289
graph colouring (287) 287
approximation (284) 284
approximation algorithms (283) 283
scheduling (278) 278
lower bounds (272) 272
edge coloring (269) 269
upper bounds (269) 269
random graphs (264) 264
artificial intelligence (263) 263
mathematical modeling and industrial mathematics (262) 262
theorems (260) 260
geometry (258) 258
mathematics of computing (250) 250
telecommunications (242) 242
decomposition (232) 232
usage (226) 226
construction (220) 220
list coloring (218) 218
cycle (217) 217
apexes (212) 212
cycles (212) 212
interference (212) 212
operations research (209) 209
girth (207) 207
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (206) 206
combinatorial optimization (204) 204
theorem (202) 202
partitions (197) 197
teoría de grafos (196) 196
data structures, cryptology and information theory (195) 195
computer systems organization and communication networks (194) 194
colouring (191) 191
computer simulation (191) 191
extremal problems (188) 188
heuristic (188) 188
graphs, theory of (185) 185
theory of graphs (185) 185
bipartite graphs (184) 184
hypergraphs (184) 184
maximum degree (184) 184
vertices (183) 183
matching (181) 181
wireless networks (180) 180
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Mathematical Sciences - Stacks (143) 143
Gerstein Science - Stacks (131) 131
Engineering & Comp. Sci. - Stacks (49) 49
UofT at Mississauga - Stacks (32) 32
UofT at Scarborough - Stacks (31) 31
UTL at Downsview - May be requested (27) 27
Online Resources - Online (24) 24
Collection Dvlpm't (Acquisitions) - Closed Orders (20) 20
Collection Dvlpm't (Acquisitions) - Vendor file (19) 19
Mathematical Sciences - Missing (9) 9
OISE - Stacks (7) 7
Trinity College (John W Graham) - Stacks (7) 7
Robarts - Stacks (5) 5
St. Michael's College (John M. Kelly) - 2nd Floor (5) 5
Chemistry (A D Allen) - Stacks (4) 4
Engineering & Comp. Sci. - May be requested in 6-10 wks (3) 3
Faculty of Information - Stacks (3) 3
Victoria University E.J. Pratt - Stacks (3) 3
Aerospace - Stacks (2) 2
Astronomy & Astrophysics - Ask at library (2) 2
New College (Ivey) - Stacks (2) 2
OISE - Curriculum Resources (2) 2
Physics - Stacks (2) 2
Physics - Storage (2) 2
Royal Ontario Museum - Stacks (2) 2
UofT Schools - Stacks (2) 2
Architecture Landscape (Shore + Moffat) - Stacks (1) 1
Business (Joseph L Rotman) - Stacks (1) 1
Chemistry (A D Allen) - In transit (1) 1
Engineering & Comp. Sci. - Missing (1) 1
Engineering & Comp. Sci. - Special Collections (1) 1
Gerstein Science - Reference (1) 1
Indust. Rel's & Hum. Resources (Newman) - Stacks (1) 1
Massey College (Robertson Davies) - Rare Book (1) 1
Mathematical Sciences - Material is damaged (1) 1
Mathematical Sciences - Reference (1) 1
Mathematical Sciences - Searching (1) 1
Robarts - Map Collection (1) 1
St. Michael's College (John M. Kelly) - Circulation Desk (1) 1
Trinity College (John W Graham) - Storage (1) 1
UofT at Mississauga - May be requested in 6-10 wks (1) 1
UofT at Scarborough - May be requested in 6-10 wks (1) 1
UofT at Scarborough - Missing (1) 1
UofT at Scarborough - Withdrawn (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (16095) 16095
Chinese (180) 180
Japanese (85) 85
Spanish (33) 33
French (31) 31
German (30) 30
Portuguese (21) 21
Czech (9) 9
Polish (8) 8
Russian (7) 7
Korean (5) 5
Turkish (4) 4
Dutch (3) 3
Indonesian (3) 3
Arabic (2) 2
Persian (2) 2
Afrikaans (1) 1
Croatian (1) 1
Italian (1) 1
Latin (1) 1
Ndonga (1) 1
Romanian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


2012, Wiley series in discrete mathematics and optimization, ISBN 9781118091371, xiv, 321
"This book provides an overview of this development as well as describes how the many different results are related"-- 
Graph theory | Graph coloring
Book
2004, Contemporary mathematics, ISBN 9780821834589, Volume 352, xii, 208
Book
1995, Wiley-Interscience series in discrete mathematics and optimization., ISBN 0471028657, xix, 295
Book
2002, Fields Institute monographs, ISBN 0821828126, Volume 17., xiii, 181
Book
Theoretical Computer Science, ISSN 0304-3975, 11/2019, Volume 795, pp. 312 - 325
We introduce the , in which two players alternately colour vertices (from a choice of colours) of a pair of isomorphic graphs while respecting the properness... 
Orthogonal colouring game | Orthogonal graph colouring | Scoring game | Mutually orthogonal Latin squares | Games on graphs | Strictly matched involution | CHROMATIC NUMBER | COMPUTER SCIENCE, THEORY & METHODS | Computer Science | Discrete Mathematics
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
Algorithmica, ISSN 0178-4617, 04/2019, Volume 81, Issue 4, pp. 1319 - 1341
In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion... 
Dynamic coloring | Computer Science(all) | Computer Science Applications | Data structures | Graphs | Amortized algorithms | Applied Mathematics
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 1/2018, Volume 34, Issue 1, pp. 97 - 107
The class of $$2K_{2}$$ 2K2 -free graphs and its various subclasses have been studied in a variety of contexts. In this paper, we are concerned with the... 
(P_3 \cup P_2)$$ ( P 3 ∪ P 2 ) -free graphs | 05C17 | Mathematics | Colouring | Clique number | Diamond | Engineering Design | Perfect graphs | Combinatorics | Chromatic number | 2K_{2}$$ 2 K 2 -free graphs | 05C15 | P | free graphs | 2 K | MATHEMATICS | 2K-free graphs | SUBGRAPHS | (P-3 boolean OR P-2)-free graphs
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2020, Volume 343, Issue 2, p. 111654
We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes... 
Signed graph | Vizing | Edge coloring
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 11/2017, Volume 89, pp. 410 - 431
The problem is that of deciding, given a graph and an integer , whether admits a (proper) -colouring. For all graphs up to five vertices, we classify the... 
Forbidden induced subgraph | Graph colouring | Diamond-free | Clique-width | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | CO-GEM-FREE | TRIANGLE-FREE GRAPHS | LINEAR-TIME | BOUNDED CLIQUE-WIDTH | COMPUTER SCIENCE, THEORY & METHODS | HEREDITARY CLASSES | FORBIDDEN SUBGRAPHS | BIPARTITE GRAPHS | Logic | Mathematics
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 02/2019, Volume 255, pp. 15 - 20
A of a graph is a coloring of its vertices such that for each vertex , at least half of the neighbors of have different color than . Let denote the least... 
Game chromatic number | Majority game chromatic number | Majority coloring | MATHEMATICS, APPLIED | CHROMATIC NUMBER | Coloring | Graphs | Graph theory | Apexes | Game theory
Journal Article
SIAM Journal on Computing, ISSN 0097-5397, 2014, Volume 43, Issue 1, pp. 72 - 95
The distributed (Delta + 1)-coloring problem is one of the most fundamental and well-studied problems in distributed algorithms. Starting with the work of Cole... 
Defective-coloring | Legal-coloring | Distributed algorithms | MATHEMATICS, APPLIED | SET | defective-coloring | PARALLEL ALGORITHM | distributed algorithms | COMPUTER SCIENCE, THEORY & METHODS | legal-coloring | Coloring | Distributed processing | Algorithms | Graph coloring | Computation | Running | Iterative algorithms | Heuristic
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 186 - 192
A hypergraph is equitably -colorable if its vertices can be partitioned into sets/color classes in such a way that monochromatic edges are avoided and the... 
Hypergraph | Feasible sequence | Linear hypertree | Equitable coloring | MATHEMATICS, APPLIED | GRAPHS | Analysis | Algorithms | Coloring | Apexes | Color | Graphs | Graph theory | Polynomials | Dynamic programming
Journal Article
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 1/2019, Volume 35, Issue 1, pp. 239 - 248
This paper studies the connectivity and biconnectivity of coloring graphs. For $$k\in \mathbb {N}$$ k ∈ N , the k-coloring graph of a base graph G has vertex... 
Mathematics | Graph coloring | Engineering Design | Combinatorics | Cut-coloring | Reconfiguration | MATHEMATICS | Coloring | Graphs | Graph theory
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 05/2018, Volume 88, Issue 1, pp. 46 - 60
It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them.... 
Berge–Fulkerson coloring | perfect matching | oddness | Berge–Fulkerson conjecture | snarks | 4‐flow | 4-flow | MATHEMATICS | CYCLE-DOUBLE COVERS | Berge-Fulkerson conjecture | ODDNESS 4 | CUBIC GRAPHS | Berge-Fulkerson coloring
Journal Article
Soft Computing, ISSN 1432-7643, 10/2017, Volume 23, Issue 4, pp. 1 - 10
Journal Article
Discrete Mathematics, ISSN 0012-365X, 01/2016, Volume 339, Issue 1, pp. 391 - 398
A strong edge-coloring of a graph is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose... 
Bipartite graphs | Strong edge-coloring | Complexity | INDUCED MATCHINGS | MATHEMATICS | STRONG CHROMATIC INDEX | Computer Science | Discrete Mathematics
Journal Article
Algorithmica, ISSN 0178-4617, 11/2018, Volume 80, Issue 11, pp. 3293 - 3315
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 04/2014, Volume 167, pp. 100 - 106
The packing chromatic number of a graph is the smallest integer such that vertices of can be partitioned into disjoint classes where vertices in have pairwise... 
Packing coloring | Distance graph | Packing chromatic number | MATHEMATICS, APPLIED | CIRCULAR CHROMATIC-NUMBERS | Computer Science | Discrete Mathematics
Journal Article
No results were found for your search.

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