X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
dually chordal graph (11) 11
dually chordal graphs (11) 11
mathematics, applied (11) 11
chordal graph (8) 8
graphs (8) 8
clique tree (7) 7
compatible tree (7) 7
mathematics (7) 7
algorithms (6) 6
mathematical analysis (5) 5
trees (5) 5
algorithmic aspects (4) 4
clique graphs (4) 4
dually chordal (4) 4
graph algorithms (4) 4
chordal (3) 3
chordal graphs (3) 3
compatibility (3) 3
complexity (3) 3
computer science (3) 3
computer science, information systems (3) 3
graph theory (3) 3
independent sets (3) 3
perfect graphs (3) 3
acyclic cubical complex (2) 2
applied mathematics (2) 2
basic chordal graph (2) 2
bipartite graphs (2) 2
chordal bipartite graphs (2) 2
clique-perfect graphs (2) 2
combinatorics (2) 2
connected domination (2) 2
discrete mathematics and combinatorics (2) 2
domination (2) 2
doubly chordal graph (2) 2
efficient algorithms (2) 2
hypergraphs (2) 2
matrices (2) 2
neighborhood inclusion (2) 2
polynomial-time algorithm (2) 2
poset (2) 2
separator (2) 2
strongly chordal graph (2) 2
strongly chordal graphs (2) 2
studies (2) 2
subclasses (2) 2
theory of computation (2) 2
tree (2) 2
tree structure (2) 2
05c12 (1) 1
1-sperner hypergraph (1) 1
1-spernerjev hipergraf (1) 1
3-colourability (1) 1
3-spanners (1) 1
[formula omitted]-domination (1) 1
[formula omitted]-labeling (1) 1
adaptation (1) 1
algorithm (1) 1
algorithm analysis and problem complexity (1) 1
approximation algorithms (1) 1
assignment (1) 1
at-free graph (1) 1
balanced graphs (1) 1
balancing (1) 1
bounded mim-width (1) 1
cell phones (1) 1
cellular (1) 1
centers (1) 1
chordal bipartite graph (1) 1
clique (1) 1
clique hypergraphs (1) 1
clique-helly graphs (1) 1
clique-transversal (1) 1
clique-width (1) 1
cographs (1) 1
combinatorial analysis (1) 1
compatible trees (1) 1
completeness (1) 1
computational complexity (1) 1
computer science - discrete mathematics (1) 1
computer science, software engineering (1) 1
computer science, theory & methods (1) 1
computer systems organization and communication networks (1) 1
connected dominating set (1) 1
connected-domishold graph (1) 1
covering and packing problems (1) 1
data processing (1) 1
data structures, cryptology and information theory (1) 1
disk hypergraph (1) 1
distance-2 (1) 1
distance-hereditary graphs (1) 1
distances (1) 1
distributed algorithm (1) 1
dominating functions (1) 1
dominating set (1) 1
dominationm (1) 1
duality (1) 1
dualization (1) 1
dually sperner hypergraph (1) 1
dualno spernerjev hipergraf (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Information Processing Letters, ISSN 0020-0190, 02/2015, Volume 115, Issue 2, pp. 256 - 262
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 2011, Volume 37, Issue C, pp. 33 - 38
Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively... 
Chordal graph | clique tree | dually chordal graph | compatible tree | Compatible tree | Dually chordal graph | Clique tree
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 07/2020, Volume 281, pp. 151 - 161
This paper is motivated by the following problem: given the family of clique trees of a chordal graph G, determine whether it is also the family of compatible trees of some dually chordal graph H... 
Poset | Chordal graph | Compatible tree | Dually chordal graph | Clique tree | Neighborhood inclusion | MATHEMATICS, APPLIED
Journal Article
Ars combinatoria, ISSN 0381-7032, 07/2015, Volume 122, pp. 13 - 20
It will be proved that the problem of determining whether a set of vertices of a dually chordal graphs is the set of leaves of a tree compatible with it can be solved in polynomial time... 
leafage | MATHEMATICS | clique tree | compatible tree | chordal | Leaf | dually chordal
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
Information Processing Letters, ISSN 0020-0190, 12/2017, Volume 128, pp. 21 - 26
In this paper, we investigate the Colourability problem for dually chordal graphs and some of... 
Dually chordal graphs | 3-colourability | Polynomial-time algorithm | Graph algorithms | Tree-breadth | ALGORITHM | COMPUTER SCIENCE, INFORMATION SYSTEMS | 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
Discrete Applied Mathematics, ISSN 0166-218X, 09/2016, Volume 210, pp. 261 - 276
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs... 
DV graph | Clique tree | Chordal graph | Compatible tree | Basic chordal graph | Dually chordal graph | RDV graph | MATHEMATICS, APPLIED | CLIQUE GRAPHS | Trees | Names | Graphs | Operators | Compatibility | Mathematical analysis
Journal Article
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 02/2014, Volume 164, Issue 2, pp. 500 - 511
Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively... 
Chordal graph | Compatible tree | Basic chordal graph | Dually chordal graph | Clique tree | MATHEMATICS, APPLIED | Trees | Graphs | Representations | Compatibility | Mathematical analysis
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2013, Volume 44, pp. 287 - 292
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs... 
Chordal graph | clique tree | dually chordal graph | compatible tree | Compatible tree | Dually chordal graph | Clique tree
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2012, Volume 160, Issue 18, pp. 2627 - 2635
Many works related to dually chordal graphs, their cliques and neighborhoods were published by Brandstädt et al. (1998) [1] and Gutierrez (1996) [6... 
Tree | Clique | Dually chordal | Chordal | Separator | Neighborhood | MATHEMATICS, APPLIED | CLIQUE GRAPHS | Mathematical analysis | Proving | Graphs | Graph theory | Separators | Intersections | Adaptation
Journal Article
Theoretical computer science, ISSN 0304-3975, 2020, Volume 814, pp. 28 - 48
A semitotal dominating set of a graph G with no isolated vertex is a dominating set D of G such that every vertex in D is within distance two of another vertex in D. The minimum size γt2(G... 
Total Dominating Set | Dually chordal graphs | Bounded mim-width | Semitotal Dominating Set | Computational complexity | SET | COMPLEXITY | CLIQUE-WIDTH | TREE | COMPLETENESS | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 12/2015, Volume 50, pp. 115 - 120
.... We also expand the set of instances where it is known that {k}PF is linear time solvable, by proving that it is so in dually chordal graphs. 
set packing | dominating set | dually chordal graph | Dominating set | Dually chordal graph | Set packing
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 05/2015, Volume 186, Issue 1, pp. 19 - 44
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph... 
Edge-coloring | Line graphs | Matchings | Clique-perfect graphs | MATHEMATICS, APPLIED | SUBCLASSES | THEOREM | INDEPENDENT SETS | MINORS | ALGORITHMIC ASPECTS | DUALLY CHORDAL GRAPHS | TREES | TRANSVERSALS | Algorithms
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 1998, Volume 82, Issue 1, pp. 43 - 77
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 2009, Volume 35, Issue C, pp. 127 - 132
Many works related to dually chordal graphs, their cliques and neighborhoods were published... 
dually chordal | separator | Graph theory
Journal Article
No results were found for your search.

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