X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (11952) 11952
Conference Proceeding (1492) 1492
Publication (1249) 1249
Book / eBook (361) 361
Newspaper Article (327) 327
Dissertation (185) 185
Book Chapter (177) 177
Paper (50) 50
Magazine Article (42) 42
Book Review (25) 25
Web Resource (24) 24
Government Document (7) 7
Trade Publication Article (7) 7
Newsletter (6) 6
Reference (6) 6
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 (5544) 5544
graphs (4661) 4661
algorithms (2700) 2700
graph theory (2690) 2690
mathematics, applied (2532) 2532
graph coloring (2505) 2505
computer science (2099) 2099
combinatorics (1526) 1526
coloring (1514) 1514
computer science, theory & methods (1206) 1206
mathematical analysis (1142) 1142
studies (952) 952
optimization (921) 921
graph (803) 803
color (765) 765
chromatic number (753) 753
combinatorial analysis (745) 745
analysis (744) 744
theoretical computer science (713) 713
mathematics - combinatorics (712) 712
discrete mathematics and combinatorics (709) 709
computer science, software engineering (667) 667
discrete mathematics (647) 647
theory of computation (623) 623
planar graphs (601) 601
complexity (588) 588
computer science, information systems (519) 519
planar graph (508) 508
mathematical models (482) 482
operations research & management science (467) 467
research (453) 453
mathematics, general (445) 445
algorithm (436) 436
applied mathematics (424) 424
integers (409) 409
trees (408) 408
05c15 (398) 398
engineering design (391) 391
networks (384) 384
number (383) 383
polynomials (375) 375
engineering, electrical & electronic (371) 371
colorings (369) 369
computer science, interdisciplinary applications (368) 368
convex and discrete geometry (354) 354
algebra (333) 333
graph algorithms (328) 328
computational complexity (318) 318
computer science, hardware & architecture (309) 309
computation (301) 301
algorithm analysis and problem complexity (292) 292
statistics & probability (291) 291
graph colouring (290) 290
operations research/decision theory (287) 287
graphentheorie (285) 285
edge coloring (269) 269
computational theory and mathematics (266) 266
computer science - discrete mathematics (260) 260
mathematical modeling and industrial mathematics (260) 260
upper bounds (260) 260
scheduling (252) 252
artificial intelligence (251) 251
geometry (249) 249
computer science, artificial intelligence (246) 246
mathematics of computing (246) 246
lower bounds (244) 244
theorems (243) 243
approximation (239) 239
approximation algorithms (237) 237
random graphs (236) 236
apexes (234) 234
telecommunications (228) 228
list coloring (221) 221
interference (210) 210
usage (204) 204
cycle (198) 198
girth (192) 192
colouring (191) 191
data structures, cryptology and information theory (191) 191
computer systems organization and communication networks (190) 190
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (187) 187
computer simulation (187) 187
operations research (187) 187
construction (185) 185
decomposition (185) 185
cycles (180) 180
edge-coloring (179) 179
heuristic (179) 179
theorem (176) 176
vertices (175) 175
combinatorial optimization (174) 174
partitions (173) 173
computational mathematics and numerical analysis (171) 171
maximum degree (168) 168
applications of mathematics (166) 166
wireless networks (164) 164
hypergraphs (155) 155
methods (155) 155
teoría de grafos (155) 155
bipartite graphs (154) 154
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Mathematical Sciences - Stacks (118) 118
Gerstein Science - Stacks (63) 63
Engineering & Comp. Sci. - Stacks (25) 25
UofT at Scarborough - Stacks (25) 25
Online Resources - Online (24) 24
UofT at Mississauga - Stacks (22) 22
Collection Dvlpm't (Acquisitions) - Vendor file (20) 20
Collection Dvlpm't (Acquisitions) - Closed Orders (14) 14
Mathematical Sciences - Missing (9) 9
UTL at Downsview - May be requested (7) 7
Trinity College (John W Graham) - Stacks (5) 5
St. Michael's College (John M. Kelly) - 2nd Floor (3) 3
Chemistry (A D Allen) - Stacks (2) 2
OISE - Stacks (2) 2
Aerospace - Stacks (1) 1
Business (Joseph L Rotman) - Stacks (1) 1
Engineering & Comp. Sci. - May be requested in 6-10 wks (1) 1
Engineering & Comp. Sci. - Missing (1) 1
Mathematical Sciences - Material is damaged (1) 1
Mathematical Sciences - Searching (1) 1
New College (Ivey) - Stacks (1) 1
Physics - Storage (1) 1
St. Michael's College (John M. Kelly) - Circulation Desk (1) 1
Trinity College (John W Graham) - Storage (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (13934) 13934
Chinese (178) 178
Japanese (79) 79
Spanish (29) 29
French (18) 18
German (17) 17
Polish (7) 7
Czech (6) 6
Korean (5) 5
Russian (5) 5
Turkish (4) 4
Indonesian (3) 3
Portuguese (3) 3
Arabic (2) 2
Persian (2) 2
Afrikaans (1) 1
Croatian (1) 1
Latin (1) 1
Romanian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


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
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
Theoretical Computer Science, ISSN 0304-3975, 11/2019, Volume 795, pp. 312 - 325
We introduce the orthogonal colouring game, in which two players alternately colour vertices (from a choice of m∈N colours) of a pair of isomorphic graphs... 
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
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
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 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 | MATHEMATICS
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 11/2017, Volume 89, pp. 410 - 431
The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vertices, we... 
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
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, 02/2019, Volume 255, pp. 15 - 20
A majority coloring of a graph is a coloring of its vertices such that for each vertex v, at least half of the neighbors of v have different color than v. Let... 
Game chromatic number | Majority game chromatic number | Majority coloring | MATHEMATICS, APPLIED | CHROMATIC NUMBER | Coloring | Graphs | Graph theory | Apexes | Game theory
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 186 - 192
A hypergraph is equitably k-colorable if its vertices can be partitioned into k 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
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 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
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 G 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
Discrete Applied Mathematics, ISSN 0166-218X, 04/2014, Volume 167, pp. 100 - 106
The packing chromatic number χρ(G) of a graph G is the smallest integer p such that vertices of G can be partitioned into disjoint classes X1,…,Xp where... 
Packing coloring | Distance graph | Packing chromatic number | MATHEMATICS, APPLIED | CIRCULAR CHROMATIC-NUMBERS | Computer Science | Discrete Mathematics
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 11/2018, Volume 89, Issue 3, pp. 288 - 303
A gem is a graph that consists of a path on four vertices plus a vertex adjacent to all four vertices of the path. A co‐gem is the complement of a gem. We... 
degree | chromatic number | χ‐boundedness | clique size | χ-boundedness | PERFECT GRAPHS | PATH | MATHEMATICS | BOUNDED CLIQUE-WIDTH | CHI | DELTA | HYPERGRAPH | OMEGA | chi-boundedness | Algorithms
Journal Article
IEEE/ACM Transactions on Networking, ISSN 1063-6692, 12/2017, Volume 25, Issue 6, pp. 3628 - 3640
Journal Article
Journal of the ACM (JACM), ISSN 0004-5411, 08/2018, Volume 65, Issue 4, pp. 1 - 21
We give a new randomized distributed algorithm for (Δ +1)-coloring in the LOCAL model, running in O (√ log Δ)+ 2 O (√log log n ) rounds in a graph of maximum... 
Distributed networks | LOCAL model | vertex coloring | Vertex coloring | NUMBER | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | DELTA | COMPUTER SCIENCE, INFORMATION SYSTEMS | GRAPHS | COMPUTER SCIENCE, SOFTWARE ENGINEERING | PARALLEL ALGORITHM | RADIO NETWORKS | INDEPENDENT SET PROBLEM | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
No results were found for your search.

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