Results 141 to 150 of about 1,930 (230)

Chordality and 2-factors in tough graphs

, 2000
Douglas C. Bauer, Gyula Y. Katona, Dieter Kratsch, H.J. Veldman   +3 more
openalex   +1 more source

Graphs of bounded chordality

A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Chaniotis, Aristotelis, Miraftab, Babak, Spirkl, Sophie   +2 more
openaire   +2 more sources

R-annihilated and independent perfect neighborhood sets in chordal graphs

, 2000
Joël Puech
openalex   +1 more source

The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots

, 2001
Ottavio M. D’Antona, Carlo Mereghetti, Fabio Zamparini   +2 more
openalex   +1 more source

Graph classes related to chordal graphs and chordal bipartite graphs

Electronic Notes in Discrete Mathematics, 2006
Jörg Bornemann, Van Bang Le, Ngoc Tuy Nguyen   +2 more
openaire   +2 more sources

Counting Temporal Paths. [PDF]

Algorithmica
Enright J, Meeks K, Molter H.
europepmc   +1 more source

Analysis of Fatty Acid Metabolism in Fetal and Failing Hearts by Single-Cell RNA Sequencing Revealed SLC27A6 as a Critical Gene in Heart Maturation. [PDF]

Acta Cardiol Sin, 2023
Zhu W, Zheng Y, Liu J, Zhao C, Sun N, Qu X, Yang H.   +6 more
europepmc   +1 more source

Clique tree generalization and new subclasses of chordal graphs

, 2002
Pankaj Kumar, C. E. Veni Madhavan
openalex   +1 more source

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc   +1 more source

How is a Chordal Graph like a Supersolvable Binary Matroid?

, 2002
Raul Cordovil, David Forge, Sulamita Klein   +2 more
openalex   +2 more sources