Results 271 to 280 of about 908,928 (292)
Some of the next articles are maybe not open access.

Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph

International Computing and Combinatorics Conference, 2017
A. Conte   +4 more
semanticscholar   +1 more source

On the tree representation of chordal graphs

Journal of Graph Theory, 1988
AbstractWe introduce the notion of the boundary clique and the k‐overlap clique graph and prove the following: Every incomplete chordal graph has two nonadjacent simplicial vertices lying in boundary cliques. An incomplete chordal graph G is k‐connected if and only if the k‐overlap clique graph gk(G) is connected.
openaire   +2 more sources

Contracting a Chordal Graph to a Split Graph or a Tree

International Symposium on Mathematical Foundations of Computer Science, 2011
P. Golovach, M. Kaminski, D. Paulusma
semanticscholar   +1 more source

Extensions and Improvements to the Chordal Graph Approach to the Multistate Perfect Phylogeny Problem

IEEE/ACM Transactions on Computational Biology & Bioinformatics, 2011
Rob Gysel, D. Gusfield
semanticscholar   +1 more source

Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner Bases

International Symposium on Symbolic and Algebraic Computation, 2015
J. D. Loera   +7 more
semanticscholar   +1 more source

Graph searching on chordal graphs

1996
Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.
Chin-Wen Ho   +4 more
openaire   +1 more source

Enumeration of Perfect Sequences of Chordal Graph

International Symposium on Algorithms and Computation, 2008
Yasuko Matsui, Ryuhei Uehara, T. Uno
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy