X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1003) 1003
Conference Proceeding (95) 95
Book Chapter (14) 14
Dissertation (13) 13
Publication (2) 2
Book / eBook (1) 1
Government Document (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
chordal graphs (421) 421
mathematics, applied (352) 352
mathematics (335) 335
chordal graph (332) 332
algorithms (284) 284
graphs (192) 192
computer science (167) 167
computer science, theory & methods (123) 123
discrete mathematics and combinatorics (99) 99
combinatorics (81) 81
theoretical computer science (80) 80
computer science, information systems (77) 77
trees (72) 72
complexity (68) 68
algorithm (67) 67
domination (64) 64
graph theory (63) 63
strongly chordal graphs (59) 59
graph algorithms (56) 56
mathematical analysis (54) 54
optimization (53) 53
theory of computation (53) 53
applied mathematics (50) 50
computer science, software engineering (48) 48
chordal bipartite graphs (44) 44
discrete mathematics (44) 44
analysis (43) 43
interval graphs (40) 40
chordal rings (39) 39
networks (39) 39
treewidth (39) 39
matrices (38) 38
chordal (36) 36
computer science, interdisciplinary applications (35) 35
strongly chordal graph (35) 35
operations research & management science (33) 33
algorithm analysis and problem complexity (32) 32
computational complexity (32) 32
computer science, hardware & architecture (31) 31
convex and discrete geometry (31) 31
recognition (31) 31
tree (31) 31
engineering, electrical & electronic (30) 30
mathematical models (30) 30
studies (30) 30
bipartite graphs (29) 29
interval-graphs (29) 29
np-complete (29) 29
mathematics - combinatorics (27) 27
statistics & probability (27) 27
hypergraphs (26) 26
intersection graphs (26) 26
planar graphs (26) 26
mathematical modeling and industrial mathematics (25) 25
mathematics of computing (25) 25
sets (25) 25
split graphs (25) 25
interval graph (24) 24
np-completeness (24) 24
polynomials (24) 24
graph (23) 23
bipartite graph (22) 22
clique tree (22) 22
perfect graphs (22) 22
planar graph (21) 21
chordal bipartite graph (20) 20
computer systems organization and communication networks (20) 20
hypercubes (20) 20
number (20) 20
operations research/decision theory (20) 20
permutation graphs (20) 20
data structures and algorithms (19) 19
data structures, cryptology and information theory (19) 19
independent sets (19) 19
parallel algorithms (19) 19
paths (19) 19
separators (19) 19
split graph (19) 19
algebra (18) 18
approximation algorithms (18) 18
approximation algorithm (17) 17
computation (17) 17
decomposition (17) 17
distance-hereditary graphs (17) 17
integers (17) 17
chordal ring (16) 16
cographs (16) 16
computational theory and mathematics (16) 16
graph algorithm (16) 16
independent spanning trees (16) 16
minimum fill-in (16) 16
parameterized complexity (16) 16
tree-width (16) 16
circular-arc graphs (15) 15
graphical models (15) 15
interconnection networks (15) 15
powers (15) 15
weakly chordal graph (15) 15
approximation (14) 14
clique-width (14) 14
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Mathematics, ISSN 0012-365X, 05/2020, Volume 343, Issue 5, p. 111769
For a graph G=(V,E) and positive integer p, the exact distance-pgraph G[♮p] is the graph with vertex set... 
Chordal graph | Tree-width | Adjacent-cliques graph | Isometric subgraph | Exact distance graph | Genus | MATHEMATICS | POWERS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2018, Volume 243, pp. 239 - 247
In this work we investigate the chordality of squares and line graph squares of graphs... 
Chordal graph | Graph square | Line graph | MATHEMATICS, APPLIED | POWERS
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 05/2019, Volume 39, Issue 2, pp. 365 - 374
Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord... 
05C75 | unichord-free graph | strongly chordal graph | MATHEMATICS
Journal Article
Linear algebra and its applications, ISSN 0024-3795, 2019
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
Journal of Scheduling, ISSN 1094-6136, 02/2019, Volume 22, Issue 1, pp. 3 - 20
Inductive k-independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling... 
Interval graphs | NP-hard problems | Job interval selection | Independent set | Inductive k-independent graphs | Chordal graphs | Parameterized complexity | INTERVAL-GRAPHS | NUMBER | RECOGNITION | MULTIVARIATE ALGORITHMICS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | JOBS | ENGINEERING, MANUFACTURING
Journal Article
Information Processing Letters, ISSN 0020-0190, 02/2015, Volume 115, Issue 2, pp. 256 - 262
Journal Article
Journal of Combinatorial Theory, Series A, ISSN 0097-3165, 04/2016, Volume 139, pp. 30 - 58
.... In this paper, we study when entrywise powers preserve positivity for matrices with structure of zeros encoded by graphs... 
Matrices with structure of zeros | Entrywise positive maps | Positive semidefiniteness | Loewner ordering | Chordal graphs | Fractional Schur powers | MATHEMATICS | HADAMARD POWERS | COMPLETIONS | POSITIVE SEMIDEFINITE MATRICES | DEFINITE MATRICES
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 01/2017, Volume 122, pp. 417 - 427
Chen et al. (1998) proved that every 18-tough chordal graph has a Hamilton cycle... 
Chordal graph | Hamilton cycle | Toughness | Hamilton-connected graph | MATHEMATICS
Journal Article
Journal of algebraic combinatorics, ISSN 1572-9192, 2017, Volume 47, Issue 1, pp. 17 - 38
Journal Article
Journal of combinatorial optimization, ISSN 1573-2886, 2012, Volume 26, Issue 3, pp. 608 - 619
Journal Article
ARS COMBINATORIA, ISSN 0381-7032, 04/2015, Volume 120, pp. 259 - 274
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals... 
MATHEMATICS | binomial edge ideal | chordal graph | closed graph
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 23, pp. 3398 - 3403
We prove a decomposition theorem for the class G of { P 2 ∪ P 3 , C 4 } -free graphs. This theorem enables us to show... 
Maximal cliques | [formula omitted]-free graphs | Chromatic number | Chordal graphs | free graphs | MATHEMATICS | SETS | C-4-free graphs | Graphs | Theorems | Decomposition | Mathematical analysis | Images
Journal Article
by Erey, N
TURKISH JOURNAL OF MATHEMATICS, ISSN 1300-0098, 2019, Volume 43, Issue 5, pp. 2405 - 2414
The independence complex of a chordal graph is known to be shellable which is equivalent to the fact that cover ideal of a chordal graph has linear quotients... 
MATHEMATICS | Chordal graph | shellable | linear quotients | cover ideal | Betti numbers
Journal Article
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 01/2018, Volume 14, Issue 1, pp. 1 - 30
In the M aximum W eight I ndependent S et problem, the input is a graph G , every vertex has a non-negative integer weight, and the task is to find a set S of pairwise nonadjacent vertices, maximizing... 
(quasi)polynomial-time algorithms | P 6 -free graphs | efficient domination | Independence | MAXIMUM WEIGHT | MATHEMATICS, APPLIED | (quasi) polynomial-time algorithms | P-5-FREE GRAPHS | SEPARATORS | P-6-free graphs | POLYNOMIAL ALGORITHM | STABLE SET PROBLEM | CHORDAL GRAPHS | P-6 | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Electronic Journal of Combinatorics, ISSN 1077-8926, 09/2016, Volume 23, Issue 3
Let G be a graph with the usual shortest-path metric. A graph is delta-hyperbolic if for every geodesic triangle T, any side of T is contained in a delta-neighborhood of the union of the other two sides... 
Geodesic | Infinite graph | Gromov hyperbolic | Chordal | MATHEMATICS | MATHEMATICS, APPLIED | geodesic | chordal | GROMOV-HYPERBOLICITY | CONSTANT
Journal Article
No results were found for your search.

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