Results 271 to 280 of about 919,306 (297)

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable

International Workshop on Graph-Theoretic Concepts in Computer Science, 2021
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general graph isomorphism ...
V. Arvind, R. Nedela, I. Ponomarenko, Peter Zeman   +3 more
semanticscholar   +1 more source

A generalization of chordal graphs

Journal of Graph Theory, 1984
AbstractIn a 3‐connected planar triangulation, every circuit of length ≥ 4 divides the rest of the edges into two nontrivial parts (inside and outside) which are “separated” by the circuit. Neil Robertson asked to what extent triangulations are characterized by this property, and conjectured an answer.
R. W. Weaver, Paul Seymour
openaire   +2 more sources

Chromaticity of Chordal Graphs

Graphs and Combinatorics, 1997
A chordal graph is a graph that does not contain any induced cycle with length greater than 3. A polynomial \(P=\lambda^{m_0}(\lambda-1)^{m_1}\cdots (\lambda-k)^{m_k}\) is said to be a chordal polynomial, if for any graph \(G\), \(P(G,\lambda)=P\) implies \(G\) is a chordal graph. The main result of this paper is the following: If \(m_0=1\) and \(\sum_{
openaire   +3 more sources

On hypergraph acyclicity and graph chordality

Information Processing Letters, 1988
Concepts of acyclicity in hypergraphs and chordality in graphs are related by showing that a hierarchy of well-studied classes of chordal graphs corresponds to the hierarchy of classes of acyclic hypergraphs studied in relational database theory [\textit{R. Fagin}, J. Assoc. Comput. Mach. 30, 514-550 (1983; Zbl 0624.68088)].
D'ATRI, Alessandro, MOSCARINI, Marina
openaire   +5 more sources

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

International Computing and Combinatorics Conference, 2017
A. Conte, M. Kanté, Y. Otachi, T. Uno, Kunihiro Wasa   +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 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, Sheng-Lung Peng, Chuan Yi Tang, Tsan-sheng Hsu, Ming-Tat Ko   +4 more
openaire   +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, S. Margulies, Michael Oesterle, Eric Riedl, D. Rolnick, Gwen Spencer, Despina Stasi, Jon Swenson   +7 more
semanticscholar   +1 more source