Results 241 to 250 of about 942,960 (263)
Some of the next articles are maybe not open access.

Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth

Journal of Graph Theory
Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H , every even‐hole‐free graph of ...
Sepehr Hajebi
semanticscholar   +1 more source

4‐Connected 1‐Planar Chordal Graphs Are Hamiltonian‐Connected

Journal of Graph Theory
Tutte proved that 4‐connected planar graphs are Hamiltonian. It is unknown if there is an analogous result on 1‐planar graphs. In this paper, we characterize 4‐connected 1‐planar chordal graphs and show that all such graphs are Hamiltonian‐connected.
Licheng Zhang   +3 more
semanticscholar   +1 more source

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

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

Minimal Elimination Ordering Inside a Given Chordal Graph

International Workshop on Graph-Theoretic Concepts in Computer Science, 1997
E. Dahlhaus
semanticscholar   +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