Results 301 to 310 of about 3,018,719 (345)

Separator Theorems for Interval Graphs and Proper Interval Graphs

2015
C.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

Interval valued m-polar fuzzy planar graph and its application

Artificial Intelligence Review, 2020
Tanmoy Mahapatra, S. Sahoo, G. Ghorai, M. Pal   +3 more
semanticscholar   +1 more source

Persistent graph stream summarization for real-time graph analytics

World wide web (Bussum), 2023
Yan Jia, Zhaoquan Gu, Zhihao Jiang, Cuiyun Gao, Jianye Yang   +4 more
semanticscholar   +1 more source

Characterizing interval graphs which are probe unit interval graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Listing Chordal Graphs and Interval Graphs

2006
We propose three algorithms for enumeration problems; given a graph G, to find every chordal supergraph (in Kn) of G, to find every interval supergraph (in Kn) of G, and to find every interval subgraph of G in Kn. The algorithms are based on the reverse search method.
Masashi Kiyomi, Shuji Kijima, Takeaki Uno   +2 more
openaire   +1 more source

A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular‐arc graphs, and nested interval graphs

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

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   +2 more sources

Decision-making method based on the interval valued neutrosophic graph

Future Technologies Conference, 2016
S. Broumi, M. Talea, F. Smarandache, A. Bakali   +3 more
semanticscholar   +1 more source

Interval fuzzy preferences in the graph model for conflict resolution

Fuzzy Optimization and Decision Making, 2017
M. A. Bashar, K. Hipel, D. Kilgour, Amer Obeidi   +3 more
semanticscholar   +1 more source

Modeling Fuzzy and Interval Fuzzy Preferences Within a Graph Model Framework

IEEE transactions on fuzzy systems, 2016
M. Abul Bashar, Amer Obeidi, D. Kilgour, K. Hipel   +3 more
semanticscholar   +1 more source