Graphs satisfying inequality θ(G2)≤θ(G)
Discrete Mathematics
Intersection graphs of maximal hypercubes
European Journal of Combinatorics
Discrete Mathematics
From hypertrees to arboreal quasi-ultrametrics
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Algorithms for clique-independent sets on subclasses of circular-arc graphs
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Note: An improved algorithm for the longest induced path problem on k-chordal graphs
Discrete Applied Mathematics
The complexity of clique graph recognition
Theoretical Computer Science
On the complexity of signed and minus total domination in graphs
Information Processing Letters
Theoretical Computer Science
From hypertrees to arboreal quasi-ultrametrics
Discrete Applied Mathematics - Ordinal and symbolic data analysis (OSDA 2000)
Collective additive tree spanners of homogeneously orderable graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Information Processing Letters
New min-max theorems for weakly chordal and dually hordal graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Cop and Robber Games When the Robber Can Hide and Ride
SIAM Journal on Discrete Mathematics
Generalized powers of graphs and their algorithmic use
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Augmenting forests to meet odd diameter requirements
Discrete Optimization
Algorithmic aspects of k-tuple total domination in graphs
Information Processing Letters
On minimal vertex separators of dually chordal graphs: Properties and characterizations
Discrete Applied Mathematics
Computing a minimum outer-connected dominating set for the class of chordal graphs
Information Processing Letters
Augmenting outerplanar graphs to meet diameter requirements
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Theoretical Computer Science
On the correspondence between tree representations of chordal and dually chordal graphs
Discrete Applied Mathematics
Characterization of classical graph classes by weighted clique graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for characterizations of those graphs in terms of neighborhood and clique hypergraphs which have the Helly property and whose line graph is chordal. These graphs are dual (in the sense of hypergraphs) to chordal graphs. By using the hypergraph approach in a systematical way new results are obtained, some of the old results are generalized, and some of the proofs are simplified.