X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1734) 1734
Conference Proceeding (103) 103
Newspaper Article (68) 68
Book Chapter (30) 30
Dissertation (20) 20
Magazine Article (5) 5
Book / eBook (4) 4
Publication (4) 4
Web Resource (3) 3
Government Document (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (344) 344
algorithms (338) 338
mathematics, applied (297) 297
analysis (229) 229
humans (166) 166
computer science (141) 141
split graph (139) 139
split graphs (134) 134
optimization (132) 132
research (128) 128
mathematical models (119) 119
graphs (108) 108
research article (106) 106
studies (105) 105
animals (100) 100
stock splits (97) 97
proteins (96) 96
engineering, electrical & electronic (95) 95
mathematical analysis (93) 93
multidisciplinary sciences (90) 90
operations research & management science (88) 88
biology and life sciences (86) 86
convergence (84) 84
research and analysis methods (84) 84
male (82) 82
algorithm (79) 79
female (79) 79
methods (79) 79
medicine (77) 77
science (77) 77
computational techniques (76) 76
multiple alignment calculation (76) 76
split-decomposition method (76) 76
usage (76) 76
sequence alignment (73) 73
computer simulation (72) 72
sequence analysis (71) 71
split (70) 70
biochemistry (68) 68
bioinformatics (68) 68
computer science, theory & methods (67) 67
materials science, multidisciplinary (67) 67
applied mathematics (65) 65
mathematics, general (64) 64
molecular biology (64) 64
phylogeny (61) 61
biology (60) 60
applications of mathematics (59) 59
database and informatics methods (58) 58
engineering (58) 58
graph theory (58) 58
split decomposition (57) 57
adult (56) 56
evolution (56) 56
hilbert space (55) 55
discrete mathematics and combinatorics (53) 53
statistics & probability (53) 53
computer science, software engineering (52) 52
design (52) 52
genetics (52) 52
split hopkinson pressure bars (52) 52
splitt (52) 52
iterative methods (51) 51
physics (51) 51
gene expression (49) 49
theory of computation (49) 49
sets (48) 48
combinatorics (47) 47
trees (47) 47
theorems (46) 46
approximation (45) 45
surgery (44) 44
cell biology (42) 42
neurosciences (42) 42
physical sciences (42) 42
projection (42) 42
numerical analysis (41) 41
genes (40) 40
genomes (40) 40
iterative algorithms (40) 40
algebra (39) 39
amino acid sequence (39) 39
genomics (39) 39
molecular biology techniques (39) 39
simulation (39) 39
decomposition (38) 38
genetic aspects (38) 38
medicine and health sciences (38) 38
middle aged (38) 38
physiological aspects (38) 38
organisms (37) 37
behavior (36) 36
chemistry (36) 36
geometry and topology (36) 36
operators (36) 36
phylogenetics (36) 36
computer science, information systems (35) 35
mechanics (35) 35
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (1952) 1952
Chinese (8) 8
Japanese (6) 6
Portuguese (6) 6
German (4) 4
French (3) 3
Czech (2) 2
Norwegian (2) 2
Belarusian (1) 1
Korean (1) 1
Russian (1) 1
Spanish (1) 1
Swedish (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, 01/2016, Volume 199, pp. 16 - 29
Bichain graphs form a bipartite analog of split permutation graphs, also known as split graphs of Dilworth number 2... 
Split permutation graph | Intersection graph | Universal graph | MATHEMATICS, APPLIED | CLIQUE-WIDTH | SUBGRAPHS | SPLIT GRAPHS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2017, Volume 216, pp. 98 - 113
A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same... 
Split graph | Threshold graph | Rainbow colouring | Rainbow connectivity | Complexity | MATHEMATICS, APPLIED | CONNECTION NUMBER | HARDNESS
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
Theoretical computer science, ISSN 0304-3975, 10/2018, Volume 745, pp. 75 - 86
.... The celebrated result of Lewis and Yannakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special... 
Vertex deletion problem | Chordal graph | Split graph | (Unit) interval graph | Hereditary property | Maximum (induced) subgraph | FIXED-PARAMETER | COMPUTER SCIENCE, THEORY & METHODS | SUBGRAPHS | HEREDITARY PROPERTIES | SPLIT | BIPARTITE GRAPHS | Information science | Algorithms
Journal Article
Theoretical computer science, ISSN 0304-3975, 10/2015, Volume 602, pp. 39 - 49
The square of a graph G, denoted G2, is obtained from G by putting an edge between two distinct vertices whenever their distance is two... 
Square of Ptolemaic graph | Square of graph | Recognition algorithm | Square of split graph | ROOTS | COMPUTER SCIENCE, THEORY & METHODS | POWERS | Algorithms | Graphs | Polynomials | Graph theory | Roots | Recognition
Journal Article
SIAM journal on discrete mathematics, ISSN 0895-4801, 2014, Volume 28, Issue 3, pp. 1449 - 1466
Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit... 
Split graphs | Class 0 | Pebbling number | Graph algorithms | Complexity | SPACE | complexity | MATHEMATICS, APPLIED | split graphs | DIAMETER 2 GRAPHS | class 0 | pebbling number | graph algorithms | Consumption | Algorithms | Orange peel | Graphs | Mathematical models | Polynomials | Transporting | Optimization
Journal Article
Journal Article
Networks, ISSN 0028-3045, 07/2014, Volume 63, Issue 4, pp. 277 - 285
.... This problem takes as input a graph G and an integer kv for every vertex v of G, and the objective is to find a vertex subset S of minimum cardinality such that every vertex v either belongs to S, or... 
approximation algorithm | tree | cograph | polynomial time algorithm | split graph | vector connectivity | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | RECOGNITION | THEOREM | ALGORITHM | APPROXIMABILITY | Algorithms | Networks | Approximation | Mathematical analysis | Graphs | Polynomials | Boundaries | Vectors (mathematics) | Hardness
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2016, Volume 211, pp. 30 - 39
A graph is H-free if it has no induced subgraph isomorphic to  H. We continue a study into the boundedness of clique-width of subclasses of perfect graphs... 
Split graph | Forbidden induced subgraph | Hereditary graph class | Perfect graph | Clique-width | MATHEMATICS, APPLIED | CO-GEM-FREE | (P-5,GEM)-FREE GRAPHS | FORBIDDEN SUBGRAPHS | TRIANGLE-FREE GRAPHS | BIPARTITE GRAPHS
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 08/2016, Volume 36, Issue 3, pp. 723 - 741
We show that every 3-regular circle graph has at least two pairs of twin vertices... 
split decomposition | regular graph | circle graph | Split decomposition | Circle graph | Regular graph | MATHEMATICS | DECOMPOSITION | RECOGNITION | Mathematics - Combinatorics
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 5/2014, Volume 30, Issue 3, pp. 633 - 646
The class of split permutation graphs is the intersection of two important classes, the split graphs and permutation graphs... 
Split graphs | Well-quasi-order | Mathematics | Engineering Design | Permutation graphs | Combinatorics | Clique-width | INDUCED SUBGRAPHS | MATHEMATICS | Graphs | Permutations | Extensibility | Thresholds | Intersections | Combinatorial analysis
Journal Article
Journal of combinatorial optimization, ISSN 1573-2886, 2012, Volume 26, Issue 3, pp. 608 - 619
Journal Article
Theoretical computer science, ISSN 0304-3975, 11/2015, Volume 607, pp. 60 - 67
...: Given a graph G, and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges... 
Split graphs | FPT algorithm | Edge contraction | Incompressibility | Parameterized complexity | COMPUTER SCIENCE, THEORY & METHODS | Integers | Kernels | Graphs | Polynomials | Graph theory | Contraction | Complexity
Journal Article
The Electronic journal of combinatorics, ISSN 1077-8926, 03/2018, Volume 25, Issue 1
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set... 
Bipartite poset | Split graph | Bijection | Set cover | Bipartite graph | set cover | bijection | MATHEMATICS | MATHEMATICS, APPLIED | bipartite poset | ENUMERATION | bipartite graph | split graph
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2014, Volume 166, pp. 91 - 96
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes... 
Split graphs | Forbidden subgraphs | Generalized graph colouring | Matrix partition | Minimal obstructions | MATHEMATICS, APPLIED | OBSTRUCTIONS | Lower bounds | Graphs | Partitions | Obstructions | Mathematical analysis | Standards
Journal Article
Theoretical computer science, ISSN 0304-3975, 10/2016, Volume 648, pp. 26 - 33
The square of a graph G, denoted by G2, is obtained from G by putting an edge between two distinct vertices whenever their distance is two... 
Square of graphs | Square of split graphs | ROOTS | COMPUTER SCIENCE, THEORY & METHODS | Algorithms | Theorems | Roots | Graphs | Polynomials | Graph theory | Cases (containers) | Dichotomies
Journal Article
Graphs and combinatorics, ISSN 0911-0119, 2012, Volume 29, Issue 5, pp. 1193 - 1206
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 216, pp. 47 - 66
We consider several graphs classes defined in terms of conditions on cliques and stable sets, including CIS, split, equistable, and other related classes... 
Triangle condition | Equistable graph | CIS graph | General partition graph | Upper bound graph | Normal graph | Split graph | Clique | Stable set | Edge simplicial graph | MATHEMATICS, APPLIED | ALGORITHMS | COMPLEXITY | SETS
Journal Article
No results were found for your search.

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