Results 241 to 250 of about 147,371 (263)
Some of the next articles are maybe not open access.
Separator Theorems for Interval Graphs and Proper Interval Graphs
2015C.L.Monma and V.K.Wei [1986, J. Comb. Theory, Ser-B, 41, 141-181] proposed a unified approach to characterize several subclasses of chordal graphs using clique separator. The characterizations so obtained are called separator theorems. Separator theorems play an important role in designing algorithms in subclasses of chordal graphs.
openaire +1 more source
Journal of Graph Theory, 1982
AbstractGiven a set F of digraphs, we say a graph G is a F‐graph (resp., F*‐graph) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in F. It is proved that all the classes of graphs mentioned in the title are F‐graphs or F*‐graphs for subsets F of a set of three digraphs.
openaire +1 more source
AbstractGiven a set F of digraphs, we say a graph G is a F‐graph (resp., F*‐graph) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in F. It is proved that all the classes of graphs mentioned in the title are F‐graphs or F*‐graphs for subsets F of a set of three digraphs.
openaire +1 more source
Interval-valued fuzzy planar graphs
International Journal of Machine Learning and Cybernetics, 2014Tarasankar Pramanik +2 more
exaly
The Roberts characterization of proper and unit interval graphs
Discrete Mathematics, 2007Frédéric Gardi
exaly
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
SIAM Journal on Computing, 1996Xiaotie Deng
exaly
Achromatic number is NP-complete for cographs and interval graphs
Information Processing Letters, 1989Hans L Bodlaender
exaly