X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
strongly chordal graphs (59) 59
mathematics, applied (42) 42
algorithms (37) 37
strongly chordal graph (36) 36
mathematics (33) 33
computer science (20) 20
domination (20) 20
graphs (20) 20
matrices (18) 18
chordal graph (17) 17
chordal graphs (15) 15
chordal bipartite graphs (13) 13
algorithm (12) 12
computer science, information systems (12) 12
computer science, theory & methods (12) 12
theoretical computer science (12) 12
combinatorics (10) 10
discrete mathematics and combinatorics (10) 10
trees (8) 8
interval graphs (7) 7
interval-graphs (7) 7
computer science, hardware & architecture (6) 6
graph algorithms (6) 6
hypergraphs (6) 6
leaf powers (6) 6
theory of computation (6) 6
connected domination (5) 5
distance-hereditary graph (5) 5
dominating sets (5) 5
graph theory (5) 5
interval graph (5) 5
np-complete (5) 5
operations research & management science (5) 5
ptolemaic graphs (5) 5
algorithm analysis and problem complexity (4) 4
applied mathematics (4) 4
complexity (4) 4
convex and discrete geometry (4) 4
data structures (4) 4
discrete mathematics (4) 4
discrete mathematics in computer science (4) 4
domatic number (4) 4
domatic partition (4) 4
engineering design (4) 4
optimization (4) 4
perfect graphs (4) 4
sets (4) 4
split graph (4) 4
strongly connected (4) 4
tree (4) 4
treewidth (4) 4
algorithmic aspects (3) 3
analysis (3) 3
bipartite graphs (3) 3
characterization (3) 3
circular-arc graph (3) 3
circular-arc graphs (3) 3
combinatorial analysis (3) 3
computational complexity (3) 3
computer science, interdisciplinary applications (3) 3
digraph (3) 3
distance-hereditary graphs (3) 3
duality (3) 3
dually chordal graphs (3) 3
graph powers (3) 3
independent domination (3) 3
intersection graphs (3) 3
k-tuple domination (3) 3
mathematical modeling and industrial mathematics (3) 3
minor (3) 3
numbers (3) 3
operations research/decision theory (3) 3
paths (3) 3
permutation graphs (3) 3
reliability (3) 3
simple elimination ordering (3) 3
spaghetti treewidth (3) 3
special treewidth (3) 3
split graphs (3) 3
steiner trees (3) 3
strongly chordal (3) 3
strongly chordal treewidth (3) 3
tree structure (3) 3
05c69 (2) 2
2 international (2) 2
6 data source (2) 2
[formula omitted]-domination (2) 2
acyclicity (2) 2
apexes (2) 2
approximation algorithms (2) 2
beta-acyclic hypergraphs (2) 2
bipartite interval graphs (2) 2
black-and-white coloring (2) 2
block graphs (2) 2
chord (2) 2
chordal (2) 2
chordal bipartite graph (2) 2
clique (2) 2
clique arrangement (2) 2
clique graphs (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of the Brazilian Computer Society, ISSN 0104-6500, 12/2014, Volume 20, Issue 1, pp. 1 - 10
...⊆E 2 and G satisfies property Π. Particurlarly, we are interested in fully classifying the complexity of this problem when we look to the following properties Π: ‘G is a chordal- (k,ℓ)-graph... 
Graph sandwich problem | Chordal–( k , ℓ )graph | Data Structures | Computer Science | Simulation and Modeling | Computer Science, general | Strongly chordal–( k , ℓ )graph | Computer System Implementation | Operating Systems | Strongly chordal–(k,ℓ)graph | Chordal–(k,ℓ)graph | Sandwiches | Algorithms
Journal Article
Journal of combinatorial optimization, ISSN 1573-2886, 2012, Volume 26, Issue 3, pp. 608 - 619
Journal Article
Journal of Combinatorial Optimization, ISSN 1382-6905, 10/2011, Volume 22, Issue 3, pp. 438 - 456
Journal Article
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 1234-3099, 08/2014, Volume 34, Issue 3, pp. 593 - 602
...) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations... 
maxclique | clique | chordal graph | strongly chordal graph | closed neighborhood | Chordal graph | Clique | Closed neighborhood | Maxclique | Strongly chordal graph | MATHEMATICS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 04/2019, Volume 259, pp. 41 - 52
.... We prove that if G is a connected strongly chordal graph in which D1... 
Domination | Stability | Transferability | Strongly chordal graphs | Cactus graphs | MATHEMATICS, APPLIED | DOMINATING SETS | Apexes | Graphs
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 3/2014, Volume 30, Issue 2, pp. 343 - 352
.... It is known that, for every vertex v of a chordal graph, there exists a simplicial vertex among the vertices at maximum distance from v... 
05C12 | Strongly chordal graph | Power chordal graph | Eccentric vertex | Chordal graph | Mathematics | Engineering Design | Combinatorics | Dually chordal graph | Doubly chordal graph | MATHEMATICS | Graphs | Eccentrics | Combinatorial analysis
Journal Article
Journal of combinatorial theory. Series B, ISSN 0095-8956, 2006, Volume 96, Issue 5, pp. 673 - 683
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
Discrete Applied Mathematics, ISSN 0166-218X, 05/2019, Volume 261, pp. 108 - 118
A linear programming algorithm to compute the broadcast domination number and the multipacking number of a strongly chordal graph is described... 
Broadcast domination | Multipacking | Strongly chordal graph | MATHEMATICS, APPLIED | NUMBERS | Algorithms | Linear programming | Graph theory | Apexes
Journal Article
UTILITAS MATHEMATICA, ISSN 0315-3681, 03/2020, Volume 114, pp. 277 - 281
Strongly chordal graphs are characterized here as being the chordal graphs in which the uncrossed chords of a cycle always form a forest... 
crossed chords | MATHEMATICS, APPLIED | STATISTICS & PROBABILITY | chordal graph | strongly chordal graph | ptolemaic graph
Journal Article
Discrete mathematics, ISSN 0012-365X, 2007, Volume 307, Issue 2, pp. 208 - 215
... ) . The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs... 
Interval graph | Directed path graph | Strongly chordal graph | Locally connected spanning tree | Circular-arc graph | Proper circular-arc graph | Algorithm | circular-arc graph | MATHEMATICS | locally connected spanning tree | MATRICES | FAILURES | strongly chordal graph | directed path graph | proper circular-arc graph | 2-TREES | algorithm | interval graph | NETWORKS IMMUNE | Algorithms
Journal Article
Information processing letters, ISSN 0020-0190, 07/2012, Volume 112, Issue 13, pp. 552 - 556
.... In this paper, we propose constant approximation algorithms for the problem of computing λ(G) for dually chordal graphs and strongly orderable graphs... 
Dually chordal graphs | Approximation algorithms | Chordal bipartite graphs | Graph algorithms | Strongly orderable graphs | [formula omitted]-labeling | L (2, 1) -labeling | DISTANCE-2 | LABELING GRAPHS | ASSIGNMENT | COMPUTER SCIENCE, INFORMATION SYSTEMS | ALGORITHMS | L(2,1)-labeling | BIPARTITE GRAPHS | Computer science | Algorithms
Journal Article
Theoretical computer science, ISSN 0304-3975, 11/2012, Volume 459, pp. 89 - 99
Journal Article
Theoretical computer science, ISSN 0304-3975, 2009, Volume 410, Issue 52, pp. 5443 - 5454
In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k ≥ 1 , a graph G = ( V G , E G ) is the k - simplicial power of a graph H... 
Simplicial powers | Forbidden induced subgraph | Ptolemaic graphs | Graph powers | Block graphs | Strongly chordal graphs | Leaf powers | Chordal graphs | CLIQUE GRAPHS | ROOTS | COMPUTER SCIENCE, THEORY & METHODS | LEAF
Journal Article
Journal of interconnection networks, ISSN 0219-2659, 10/2015, Volume 15, Issue 1-2
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2015, Volume 181, pp. 221 - 234
In this paper, we present the clique arrangement A(G) for a chordal graph G to describe the intersections between the maximal cliques of G more precisely than in clique trees or related concepts... 
Characterization | Clique arrangement | Chordal graph | Strongly chordal graph | Clique separator graph | Clique tree | MATHEMATICS, APPLIED | TREES | Trees | Graphs | Mathematical models | Intersections | Computation
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 07/2013, Volume 161, Issue 10-11, pp. 1395 - 1401
Journal Article
Theoretical computer science, ISSN 0304-3975, 2007, Volume 381, Issue 1, pp. 57 - 67
...] on graph sandwich problems published in 1995, left the status of sandwich problems for strongly chordal graphs and chordal bipartite graphs open... 
Sandwich problem | Graph | Strongly chordal | Chordal | strongly chordal | chordal | sandwich problem | MATRICES | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | graph
Journal Article
Discussiones Mathematicae. Graph Theory, ISSN 1234-3099, 2012, Volume 32, Issue 4, pp. 607 - 615
... of i. Results include the following: A graph is strongly chordal if and only if, for i. {4, 6}, every cycle C with vertical bar V... 
Ptolemaic graph | Chordal graph | Trivially perfect graph | Threshold graph | Strongly chordal graph | Chord | MATHEMATICS | threshold graph | chord | chordal graph | strongly chordal graph | trivially perfect graph | ptolemaic graph
Journal Article
No results were found for your search.

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