Results 191 to 200 of about 655,680 (212)
Some of the next articles are maybe not open access.

Clique Partitions of Chordal Graphs

Combinatorics, Probability and Computing, 1993
To partition the edges of a chordal graph on n vertices into cliques may require as many as n2/6 cliques; there is an example requiring this many, which is also a threshold graph and a split graph. It is unknown whether this many cliques will always suffice. We are able to show that (1 − c)n2/4 cliques will suffice for some c > 0.
Paul Erdös   +2 more
openaire   +3 more sources

Chordal graphs, interval graphs, and wqo

Journal of Graph Theory, 1998
Let \(\preceq\) be the induced-minor relation. It is shown that, for every \(t\), all chordal graphs of clique number at most \(t\) are well-quasi-ordered by \(\preceq\). On the other hand, if the bound on the clique number is dropped, even the class of interval graphs is not well-quasi-ordered by \(\preceq\).
openaire   +3 more sources

Fuzzy Chordal Graphs and Its Properties

International Journal of Applied and Computational Mathematics, 2021
Sovan Samanta, Kousik Das, Sovan Samanta
exaly  

Chordal Probe Graphs

Discrete Applied Mathematics, 2004
Martin Charles Golumbic
exaly  

The Maximum k-Colorable Subgraph Problem for Chordal Graphs

Information Processing Letters, 1987
Fanica Gavril, Mihalis Yannakakis
exaly  

On the Complexity of the Sandwich Problems for Strongly Chordal Graphs and Chordal Bipartite Graphs

Theoretical Computer Science, 2007
L Faria   +2 more
exaly  

Reconfiguration Graphs for Vertex Colourings of Chordal and Chordal Bipartite Graphs

Journal of Combinatorial Optimization, 2014
Daniël Paulusma   +2 more
exaly  

Independent Domination in Chordal Graphs

Operations Research Letters, 1982
Martin Farber
exaly  

Home - About - Disclaimer - Privacy