Results 11 to 20 of about 908,928 (292)
Graphs of low chordality [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3. We show that co-circular-arc graphs and co-circle graphs have even chordality at most 4.
Sunil L Chandran +2 more
+10 more sources
Treewidth of Chordal Bipartite Graphs [PDF]
Journal of Algorithms, 1995 Summary: Chordal bipartite graphs are exactly those bipartite graphs in which every cycle of length at least six has a chord. The treewidth of a graph \(G\) is the smallest maximum cliquesize among all chordal supergraphs of \(G\) decreased by one.
Ton Kloks, Dieter Kratsch
openalex +8 more sources
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.
Christophe Paul, Jan Arne Telle
openalex +3 more sources
Discrete Mathematics, 1994 The authors characterize those multigraphs which are squares of chordal graphs and develop an algorithm for producing the unique square root from its squared chordal graph.
F. Harary, T. McKee
semanticscholar +2 more sources
Chordal Completions of Planar Graphs
Journal of Combinatorial Theory, Series B, 1994 A graph is chordal if there are no induced cycles of length 4 or more. A chordal completion of a graph is formed by adding edges until the resulting graph is chordal. What is the minimal number of edges in a chordal completion? The authors answer this question for the class of planar graphs: every planar graph on \(n\) vertices has a chordal completion
Fan Chung, D. Mumford
openalex +3 more sources
On chordal phylogeny graphs [PDF]
Discrete Applied Mathematics, 2021 An acyclic digraph each vertex of which has indegree at most $i$ and outdegree at most $j$ is called an $(i, j)$ digraph for some positive integers $i$ and $j$. Lee {\it et al.} (2017) studied the phylogeny graphs of $(2, 2)$ digraphs and gave sufficient conditions and necessary conditions for $(2, 2)$ digraphs having chordal phylogeny graphs.
Soogang Eoh, Suh-Ryung Kim
openaire +3 more sources
Discrete Applied Mathematics, 2008 AbstractPolar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NP-complete to decide for general graphs. It has been recently proved that for cographs, the existence of such a partition can be characterized by finitely many forbidden subgraphs,
Tınaz Ekim +3 more
openalex +3 more sources
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 Separator Theorem for Chordal Graphs [PDF]
SIAM Journal on Algebraic Discrete Methods, 1984 A graph is called chordal if every cycle of it of length at least four has a chord. In the paper it is proved: Let G be a chordal graph with n vertices and m edges. Then G has a set of O(\(\sqrt{m})\) vertices whose removal leaves no connected component with more than n/2 vertices.
John R. Gilbert +2 more
openalex +5 more sources