Results 11 to 20 of about 10,951 (224)
Edge erasures and chordal graphs [PDF]
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 +3 more sources
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
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
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
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
Axiomatic characterizations of Ptolemaic and chordal graphs [PDF]
Opuscula Mathematica, 2023 The interval function and the induced path function are two well studied class of set functions of a connected graph having interesting properties and applications to convexity, metric graph theory. Both these functions can be framed as special instances
Manoj Changat +2 more
doaj +1 more source
Further results on Hendry's Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are imposed.
Manuel Lafond +2 more
doaj +1 more source
A Short Proof of the Size of Edge-Extremal Chordal Graphs
Journal of Mathematical Sciences and Modelling, 2022 [3] have recently determined the maximum number of edges of a chordal graph with a maximum degree less than $d$ and the matching number at most $\nu$ by exhibiting a family of chordal graphs achieving this bound. We provide simple proof of their result.
Mordechai Shalom
doaj +1 more source
Semipaired Domination in Some Subclasses of Chordal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$-element subsets such that the vertices in each set are at distance at most $2$. The semipaired domination number, denoted
Michael A. Henning +2 more
doaj +1 more source
Branchwidth of chordal graphs [PDF]
Discrete Applied Mathematics, 2009 This paper revisits the ‘branchwidth territories' of Kloks, Kratochvíl and Müller [T. Kloks, J. Kratochvíl, H. Müller, New branchwidth territories, in: 16th Ann. Symp. on Theoretical Aspect of Computer Science, STACS, in: Lecture Notes in Computer Science, vol. 1563, 1999, pp.
Paul, Christophe, Telle, Jan Arne
openaire +1 more source