Results 1 to 10 of about 1,986,691 (177)
Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs [PDF]
Discrete Applied Mathematics, 2000 In this paper those graphs are studied for which a so-called strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way.
Feodor F. Dragan
exaly +2 more sources
Some of the next articles are maybe not open access.
Strong clique trees, neighborhood trees, and strongly chordal graphs
Journal of Graph Theory, 2000Terry Allan McKee
exaly
-labeling of dually chordal graphs and strongly orderable graphs
Information Processing Letters, 2012B S Panda
exaly
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Discrete Applied Mathematics, 2015Ragnar Nevries
exaly
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Information Processing Letters, 1992Maw Shang Chang
exaly
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization, 2010Charis Papadopoulos +2 more
exaly
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs
Discrete Mathematics, 2007Gerard Jennhwa Chang +2 more
exaly
Mutual transferability for -domination on strongly chordal graphs and cactus graphs
Discrete Applied Mathematics, 2019Chiuyuan Chen
exaly
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics, 2013Gerard Jennhwa Chang, Jiaojiao Wu
exaly