X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (4287) 4287
Conference Proceeding (2294) 2294
Book Chapter (75) 75
Dissertation (61) 61
Publication (22) 22
Magazine Article (14) 14
Book / eBook (9) 9
Web Resource (8) 8
Paper (3) 3
Government Document (2) 2
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
bipartite graph (3531) 3531
mathematics (1523) 1523
bipartite graphs (955) 955
mathematics, applied (894) 894
graphs (825) 825
algorithms (814) 814
computer science (718) 718
graph theory (532) 532
engineering, electrical & electronic (473) 473
parity check codes (356) 356
computer science, information systems (340) 340
algorithm design and analysis (314) 314
computer science, theory & methods (298) 298
optimization (286) 286
discrete mathematics and combinatorics (274) 274
analysis (273) 273
complete bipartite graph (273) 273
mathematical analysis (265) 265
iterative decoding (258) 258
polynomials (253) 253
combinatorics (248) 248
decoding (244) 244
networks (230) 230
theoretical computer science (215) 215
matching (207) 207
telecommunications (194) 194
bipartite (182) 182
trees (176) 176
algorithm (159) 159
research (156) 156
computer science, software engineering (155) 155
mathematical models (153) 153
graph (149) 149
computer science, artificial intelligence (147) 147
complexity (143) 143
sparse matrices (140) 140
usage (139) 139
clustering algorithms (138) 138
computer science, interdisciplinary applications (136) 136
data mining (135) 135
approximation algorithms (134) 134
conferences (129) 129
educational institutions (127) 127
topology (127) 127
computational modeling (126) 126
iterative algorithms (125) 125
computational complexity (124) 124
bipartite matching (118) 118
complete bipartite graphs (117) 117
discrete mathematics (117) 117
complexity theory (116) 116
computer science, hardware & architecture (116) 116
equations (116) 116
information theory (115) 115
studies (115) 115
applied mathematics (112) 112
operations research & management science (112) 112
partitioning algorithms (112) 112
routing (112) 112
upper bound (112) 112
mathematics - combinatorics (110) 110
vectors (110) 110
number (107) 107
resource management (107) 107
throughput (106) 106
electronic mail (105) 105
artificial intelligence (102) 102
perfect matching (102) 102
computer simulation (100) 100
statistics & probability (98) 98
bipartite graph matching (97) 97
complex networks (93) 93
eigenvalues and eigenfunctions (93) 93
encoding (92) 92
switches (90) 90
multi-agent systems (89) 89
social network services (88) 88
combinatorial analysis (87) 87
algebra (86) 86
belief propagation (86) 86
construction (86) 86
convergence (86) 86
heuristic algorithms (86) 86
theory of computation (86) 86
joining processes (85) 85
matrices (85) 85
decomposition (84) 84
computation (83) 83
graphentheorie (83) 83
mathematical model (83) 83
mathematics, interdisciplinary applications (83) 83
integers (82) 82
bipartite consensus (81) 81
indexes (81) 81
measurement (81) 81
clustering (80) 80
cycle (80) 80
internet (78) 78
tree (78) 78
bipartite networks (77) 77
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (6713) 6713
Japanese (41) 41
Chinese (13) 13
Portuguese (8) 8
French (6) 6
Korean (6) 6
Czech (2) 2
German (2) 2
Russian (2) 2
Spanish (2) 2
Arabic (1) 1
Croatian (1) 1
Indonesian (1) 1
Serbian (1) 1
Turkish (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Computer and System Sciences, ISSN 0022-0000, 11/2017, Volume 89, pp. 410 - 431
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... 
Bipartite graphs | Strong edge-coloring | Complexity | INDUCED MATCHINGS | MATHEMATICS | STRONG CHROMATIC INDEX | Computer Science | Discrete Mathematics
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 9/2019, Volume 35, Issue 5, pp. 1169 - 1177
A dominating set of a graph G is a set $$D\subseteq V_G$$ D ⊆ V G such that every vertex in $$V_G-D... 
05C76 | Domination number | Bipartization | Mathematics | Engineering Design | Bipartite graph | Combinatorics | 05C69 | 05C05 | MATHEMATICS | EQUAL DOMINATION | Graphs | Mathematics - Combinatorics
Journal Article
Discrete Mathematics, ISSN 0012-365X, 07/2016, Volume 339, Issue 7, pp. 1960 - 1969
Recently, Milanič and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight 1 if and only... 
Equistable graph | Bipartite graph | General partition graph | Equistarable graph | 2-extendable graph | Construction | Forests | Mathematical analysis | Triangles | Graphs | Complement | Graph theory | Combinatorial analysis
Journal Article
Image and vision computing, ISSN 0262-8856, 2009, Volume 27, Issue 7, pp. 950 - 959
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2014, Volume 168, pp. 26 - 33
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction... 
Perfectly orderable graph | Opposition graph | One-in-one-out graph | Bipartite permutation graph | Coalition graph | MATHEMATICS, APPLIED | COMPLEXITY | Algorithms | Permutations | Mathematical analysis | Byproducts | Graphs | Associations | Character recognition | Joints | Recognition
Journal Article
International Journal of Robust and Nonlinear Control, ISSN 1049-8923, 01/2017, Volume 27, Issue 1, pp. 3 - 14
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 12/2019, Volume 796, pp. 22 - 33
A Stick graph is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a “ground line,” a line with slope −1... 
Graph Drawing | Intersection Graphs | Stick Graphs | Bipartite Graphs | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 01/2016, Volume 81, Issue 1, pp. 35 - 49
A graph G is equimatchable if each matching in G is a subset of a maximum‐size matching and it is factor critical if G... 
equimatchable | factor‐critical | 05C10 | degeneracy | genus | bipartite | 05C70 | embedding | 05C35 | graph | matching | factor-critical | MATHEMATICS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2019, Volume 282, pp. 208 - 221
The class of Parikh word representable graphs were recently introduced. In this work, we further develop its general theory beyond the binary alphabet... 
Parikh word representable graph | Bipartite permutation graph | Parikh matrices | Hamiltonian cycle | Diameter | MATHEMATICS, APPLIED | CONJECTURE
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2018, Volume 235, pp. 184 - 201
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex that has a neighbor in each of the other color classes... 
b-chromatic number | b-chromatic index | b-colorings | b-continuous graphs | b-critical graphs | b-perfect graphs | PERFECT GRAPHS | MATHEMATICS, APPLIED | REGULAR GRAPHS | POWER GRAPHS | CONTINUITY | TIGHT GRAPHS | BOUNDS | FAMILIES | CARTESIAN PRODUCT | KNESER GRAPHS | BIPARTITE GRAPHS
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 4/2018, Volume 35, Issue 3, pp. 740 - 753
A graph $$G=(V,E)$$ G=(V,E) with even number vertices is called Pfaffian if it has a Pfaffian orientation, namely it admits an orientation such that the number of edges of any M-alternating cycle which have the same direction... 
Convex and Discrete Geometry | Operations Research/Decision Theory | Mathematics | Theory of Computation | Mathematical Modeling and Industrial Mathematics | Bipartite graph | Combinatorics | Perfect matching | Algorithm | Optimization | Pfaffian orientation
Journal Article
Asian-European Journal of Mathematics, ISSN 1793-5571, 02/2019, Volume 12, Issue 1
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2016, Volume 201, pp. 182 - 190
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 06/2014, Volume 540-541, Issue 1, pp. 89 - 102
In this paper, we consider the selective graph coloring problem. Given an integer k≥1 and a graph G=(V,E) with a partition V1... 
Split graphs | PTAS | Complete q-partite graphs | Approximation algorithms | Scheduling | Clustering | Computational complexity | Bipartite graphs | CHORDAL GRAPHS | COMPUTER SCIENCE, THEORY & METHODS | Integers | Graphs | Partitions | Graph coloring | Complexity | Computer Science
Journal Article
Electronic Journal of Linear Algebra, ISSN 1537-9582, 2017, Volume 32, pp. 217 - 231
A graph G is said to be nonsingular (resp., singular) if its adjacency matrix A(G) is nonsingular (resp., singular). The inverse of a nonsingular graph G... 
Adjacency matrix | Inverse graph | Bicyclic graph | Alternating path | Perfect matching | MATHEMATICS | TREES | Perfect Matching | BIPARTITE GRAPHS
Journal Article
No results were found for your search.

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