Results 1 to 10 of about 908,826 (201)
Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs [PDF]
Logical Methods in Computer Science, 2019 We show that the class of chordal claw-free graphs admits LREC$_=$-definable canonization. LREC$_=$ is a logic that extends first-order logic with counting by an operator that allows it to formalize a limited form of recursion.
Berit Grußien
doaj +3 more sources
Discrete Mathematics & Theoretical Computer Science, 2019 Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph $G=(V,E)$, a geodesic triangle $\bigtriangleup(x,y,z)$ with $x, y, z\in V$ is the union $P(x,y) \cup P(x,z) \cup P(y,z)$ of three shortest paths connecting ...
Feodor F. Dragan, Abdulhakeem Mohammed
doaj +3 more sources
An Edge-Signed Generalization of Chordal Graphs, Free Multiplicities on Braid Arrangements, and Their Characterizations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 In this article, we propose a generalization of the notion of chordal graphs to signed graphs, which is based on the existence of a perfect elimination ordering for a chordal graph. We give a special kind of filtrations of the generalized chordal graphs,
Takuro Abe, Koji Nuida, Yasuhide Numata
doaj +2 more sources
The leafage of a chordal graph
Discussiones Mathematicae Graph Theory, 1998 The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes.
Lin, In-Jen +2 more
core +4 more sources
Componentwise linearity of ideals arising from graphs [PDF]
Le Matematiche, 2008 Let G be a simple undirected graph on n vertices.
Veronica Crispin, Eric Emtander
doaj +4 more sources
How is a chordal graph like a supersolvable binary matroid? [PDF]
Discrete Mathematics, 2004 Raul Cordovil +2 more
openalex +2 more sources
The Neighborhood Polynomial of Chordal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor.
Helena Bergold +2 more
doaj +1 more source
Metric dimension parameterized by treewidth in chordal graphs [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2023 The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G.
N. Bousquet +2 more
semanticscholar +1 more source
Properties and Recognition of Atom Graphs
Algorithms, 2022 The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees.
Geneviève Simonet, Anne Berry
doaj +1 more source
Edge erasures and chordal graphs
Electronic Journal of Graph Theory and Applications, 2021 We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.
Jared Culbertson +2 more
doaj +1 more source