Results 21 to 30 of about 946,691 (269)

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

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

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs [PDF]

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bonamy, M., Johnson, M., Lignos, I., Patel, V., Paulusma, Daniel   +4 more
openaire   +3 more sources

$b$-vectors of chordal graphs [PDF]

Journal of Commutative Algebra, 2020
19 pages. 4 figures.
Montejano, Luis Pedro, Núñez-Betancourt, Luis   +1 more
openaire   +3 more sources

On the Complexity of Finding a Sun in a Graph [PDF]

, 2010
The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain
Hoàng, Chính T.
core   +2 more sources

Linear transformations between colorings in chordal graphs [PDF]

Embedded Systems and Applications, 2019
Let $k$ and $d$ be such that $k \ge d+2$. Consider two $k$-colorings of a $d$-degenerate graph $G$. Can we transform one into the other by recoloring one vertex at each step while maintaining a proper coloring at any step? Cereceda et al.
N. Bousquet, Valentin Bartier
semanticscholar   +1 more source

Dually Chordal Graphs

SIAM Journal on Discrete Mathematics, 1994
The authors give a unified framework for characterizations of graphs which are dual (in the sense of hypergraphs) to chordal graphs, in terms of neighborhood and clique hypergraphs. By using the hypergraph approach in a systematical way, new results are obtained, a part of previous results are generalized, and some of the proofs are simplified.
Brandstadt, A., Dragan, F.F., Chepoi, V.D., Voloshin, V.I.   +3 more
openaire   +3 more sources

Polynomial kernels for edge modification problems towards block and strictly chordal graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block graph or
Maël Dumas, Anthony Perez, Mathis Rocton, Ioan Todinca   +3 more
doaj   +1 more source

The Dilworth Number of Auto-Chordal-Bipartite Graphs [PDF]

, 2013
The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E) has the same color classes X and Y as B, and two vertices x in X and y in Y are adjacent in mir(B) if and only if xy is not in E. A bipartite graph is chordal bipartite if none of
Berry, Anne, Brandstädt, Andreas, Engel, Konrad   +2 more
core   +1 more source

Chordal probe graphs

Discrete Applied Mathematics, 2003
A graph \(G=(V, E)\) is a chordal probe graph if there exists a partition \(V=P\cup N\) with a stable set \(N\) and a completion \(E'\subseteq\{uv : u\not= v\in N\}\) such that the graph \((V, E\cup E')\) is a chordal graph. Chordal probe graphs generalize probe interval graphs introduced by P. Zhang; see also [\textit{F. R. McMorris, C.
Golumbic, Martin Charles, Lipshteyn, Marina   +1 more
openaire   +2 more sources