X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (4470) 4470
Conference Proceeding (2325) 2325
Publication (389) 389
Dissertation (107) 107
Book Chapter (72) 72
Book / eBook (7) 7
Web Resource (7) 7
Paper (3) 3
Government Document (2) 2
Reference (2) 2
Data Set (1) 1
Magazine Article (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
bipartite graph (3481) 3481
mathematics (1499) 1499
bipartite graphs (961) 961
mathematics, applied (881) 881
graphs (819) 819
algorithms (801) 801
computer science (728) 728
graph theory (505) 505
engineering, electrical & electronic (447) 447
parity check codes (355) 355
computer science, information systems (320) 320
algorithm design and analysis (314) 314
computer science, theory & methods (293) 293
complete bipartite graph (282) 282
optimization (279) 279
analysis (274) 274
discrete mathematics and combinatorics (269) 269
mathematical analysis (267) 267
iterative decoding (258) 258
polynomials (251) 251
combinatorics (247) 247
decoding (240) 240
networks (224) 224
theoretical computer science (216) 216
matching (205) 205
telecommunications (183) 183
trees (180) 180
bipartite (169) 169
algorithm (161) 161
computer science, software engineering (156) 156
mathematical models (156) 156
research (156) 156
graph (147) 147
sparse matrices (141) 141
complexity (140) 140
clustering algorithms (136) 136
usage (136) 136
approximation algorithms (133) 133
data mining (133) 133
computer science, artificial intelligence (132) 132
computer science, interdisciplinary applications (132) 132
educational institutions (129) 129
iterative algorithms (127) 127
conferences (126) 126
computational modeling (125) 125
complete bipartite graphs (124) 124
studies (123) 123
computational complexity (118) 118
equations (118) 118
computer science, hardware & architecture (117) 117
topology (117) 117
routing (116) 116
complexity theory (115) 115
bipartite matching (114) 114
discrete mathematics (114) 114
applied mathematics (113) 113
information theory (113) 113
upper bound (113) 113
partitioning algorithms (111) 111
vectors (111) 111
mathematics - combinatorics (110) 110
number (109) 109
operations research & management science (107) 107
electronic mail (105) 105
perfect matching (105) 105
throughput (105) 105
artificial intelligence (104) 104
resource management (102) 102
computer simulation (96) 96
statistics & probability (96) 96
bipartite graph matching (94) 94
complex networks (92) 92
encoding (92) 92
decomposition (91) 91
matrices (91) 91
theory of computation (90) 90
combinatorial analysis (89) 89
social network services (89) 89
algebra (87) 87
belief propagation (87) 87
construction (86) 86
eigenvalues and eigenfunctions (86) 86
heuristic algorithms (85) 85
integers (85) 85
joining processes (85) 85
switches (85) 85
computation (83) 83
cycle (83) 83
graphentheorie (83) 83
tree (83) 83
index medicus (82) 82
measurement (81) 81
mathematical model (80) 80
mathematics, interdisciplinary applications (79) 79
internet (78) 78
computational theory and mathematics (77) 77
convergence (75) 75
clustering (74) 74
color (74) 74
channels (73) 73
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (6580) 6580
Chinese (53) 53
Japanese (41) 41
Korean (6) 6
French (3) 3
German (2) 2
Portuguese (2) 2
Russian (2) 2
Spanish (2) 2
Arabic (1) 1
Catalan (1) 1
Croatian (1) 1
Indonesian (1) 1
Turkish (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, 12/2019, Volume 271, pp. 25 - 48
For any class C of bipartite graphs, we define quasi-C to be the class of all graphs G such that every bipartition of G belongs to C. This definition is... 
Bipartite permutation graph | Monotone graph | Hereditary graph class | Switch Markov chain | Polynomial time recognition | MATHEMATICS, APPLIED | Permutations | Markov chains | Graphs | Polynomials | Algorithms | Binary system
Journal Article
Discrete Mathematics, ISSN 0012-365X, 08/2019, Volume 342, Issue 8, pp. 2415 - 2428
In this paper, we introduce the Pell graphs, a new family of graphs similar to the Fibonacci cubes. They are defined on certain ternary strings (Pell strings)... 
Fibonacci cube | Bipartite graph | Median graph | Subhypercube | Hypercube | MATHEMATICS | FIBONACCI CUBES | LUCAS | ENUMERATIVE PROPERTIES
Journal Article
Discrete Mathematics, ISSN 0012-365X, 11/2013, Volume 313, Issue 21, pp. 2390 - 2400
One method of graph decomposition is to define a binary operation on the set of graphs and to represent graphs as products of prime elements with respect to... 
Graph decomposition | Bipartite chain graphs | NLC-width | [formula omitted]-threshold graphs | Finite list of forbidden induced subgraphs | Canonical decomposition | Threshold-width | Difference graphs | Threshold graphs | Clique-width | H-threshold graphs | RECOGNITION | SEQUENCES | DECOMPOSITION | MATHEMATICS
Journal Article
Journal of Intelligent and Fuzzy Systems, ISSN 1064-1246, 2019, Volume 36, Issue 2, pp. 1917 - 1925
For a graph G = (V, E) the L(3, 1, 1)-labeling is a mapping mu from the vertex set V to the set of non-negative integers {0, 1, 2, ...} such that vertical bar... 
1)-labeling | Square of complete bipartite graphs | Square of paths | Frequency assignment | Square of complete graphs | L(3,1,1)-labeling | square of paths | square of complete bipartite graphs | PRODUCT | INTUITIONISTIC FUZZY GRAPHS | square of complete graphs | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | Integers | Apexes | Labelling | Graphs | Mapping | Graph theory | Labeling
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2018, Volume 775, p. 16
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily... 
Terminal-pairability | Complete bipartite graph | Edge-disjoint paths
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
Journal Article
IEEE Transactions on Knowledge and Data Engineering, ISSN 1041-4347, 01/2017, Volume 29, Issue 1, pp. 57 - 71
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 10/2016, Volume 506, pp. 279 - 307
We study the concept of the Coxeter energy of graphs and digraphs (quivers) as an analogue of Gutman's adjacency energy, which has applications in theoretical... 
Coxeter polynomial | Graph energy | Salem tree | Dynkin graphs | Coxeter matrix | Graph eigenvalues | Coxeter energy | Tree | SPECTRAL CLASSIFICATION | MATHEMATICS, APPLIED | PI-ELECTRON ENERGY | LAPLACIAN ENERGY | MAHLER MEASURE | MATHEMATICS | EIGENVALUES | COMPUTING GRAM CONGRUENCES | ALGEBRAS | TREES | EDGE-BIPARTITE GRAPHS | TRANSFORMATIONS | Algebra
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2019, Volume 271, pp. 171 - 183
A proper k-coloring with colors 1,2,…,k of a graph G=(V,E) is an ordered partition (V1,V2,…,Vk) of V such that Vi is an independent set or color class in which... 
Star-convex bipartite graphs | Perfect elimination bipartite graphs | Chordal graphs | Partial Grundy coloring | NP-completeness | Polynomial time algorithms | MATHEMATICS, APPLIED | Coloring | Codes | Algorithms | Upper bounds | Binary system | Color | Graphs
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2020, Volume 806, pp. 402 - 415
•We study vertex labelings of bipartite graphs by strings, edges representing overlaps.•The corresponding parameter called readability denotes the minimum... 
Grid graph | Bipartite graph | Readability | Euler's totient function
Journal Article
IEEE Transactions on Signal Processing, ISSN 1053-587X, 10/2013, Volume 61, Issue 19, pp. 4673 - 4685
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 Mathematics, ISSN 0012-365X, 02/2020, Volume 343, Issue 2, p. 111663
The classical Ore’s Theorem states that every graph G of order n≥3 with σ2(G)≥n is hamiltonian, where σ2(G)=min{dG(x)+dG(y):x,y∈V(G),x≠y,xy∉E(G)}. Recently,... 
Hamiltonian cycle | Ore’s Theorem | Bipartite graph | MATHEMATICS | Ore's Theorem
Journal Article
IEEE Transactions on Signal Processing, ISSN 1053-587X, 07/2014, Volume 62, Issue 14, pp. 3578 - 3590
Journal Article
Discrete Mathematics, ISSN 0012-365X, 06/2020, Volume 343, Issue 6, p. 111834
Using an algebraic characterization of circle graphs, Bouchet proved in 1999 that if a bipartite graph G is the complement of a circle graph, then G is a... 
Complementation | Bipartite graphs | Circle graphs
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 11/2017, Volume 532, pp. 222 - 230
We consider only connected bipartite graphs G with a unique perfect matching M. Let Gw be the weighted graph obtained from G by giving weights to its edges... 
Adjacency matrix | Inverse graph | Unique perfect matching | Weighted graph | MATHEMATICS | MATHEMATICS, APPLIED | TREES | BIPARTITE GRAPHS
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$$ V G - D is adjacent to at least one vertex in D, and the... 
05C76 | Domination number | Bipartization | Mathematics | Engineering Design | Bipartite graph | Combinatorics | 05C69 | 05C05 | MATHEMATICS | EQUAL DOMINATION | Graphs | Mathematics - Combinatorics
Journal Article
IEEE Transactions on Signal Processing, ISSN 1053-587X, 12/2014, Volume 62, Issue 24, pp. 6425 - 6437
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 11/2019, Volume 92, Issue 3, pp. 230 - 236
Given a bipartite graph G = ( S ∪ ˙ T , E ) with bipartition S , T each spanning tree in G has a degree sequence on S and one on T. Löhne and Rudloff showed... 
degree sequences | spanning trees | bipartite graphs | MATHEMATICS
Journal Article
No results were found for your search.

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