Results 11 to 20 of about 157,845 (305)
Reconstruction of interval graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masashi Kiyomi +2 more
openaire +3 more sources
Interval graphs and interval orders
This paper investigates the connection between interval graphs and interval orders, with special attention to the family of interval orders that agree with or provide representations of an interval graph. Relationships between interval graphs and interval orders that concern the number of lengths required for interval representations and bounds on ...
Fishburn, Peter C.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fred R. McMorris +2 more
openaire +3 more sources
Certain Types of Interval-Valued Fuzzy Graphs [PDF]
We propose certain types of interval-valued fuzzy graphs including balanced interval-valued fuzzy graphs, neighbourly irregular interval-valued fuzzy graphs, neighbourly total irregular interval-valued fuzzy graphs, highly irregular interval-valued fuzzy
Muhammad Akram +2 more
doaj +2 more sources
Interval-Valued Fuzzy Soft Graphs
In this paper, we combine concepts of interval-valued fuzzy soft sets and graph theory. Then we introduce notations of interval-valued fuzzy soft graphs and complete interval-valued fuzzy soft graphs.
Zihni Onur +2 more
doaj +2 more sources
On counting interval lengths of interval graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Márcia R. Cerioli +2 more
openaire +3 more sources
Interval k-Graphs and Orders [PDF]
An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes.
David E. Brown +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mulder, Henry Martyn
openaire +3 more sources
Recognizing edge clique graphs among interval graphs and probe interval graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jing Kong, Yaokun Wu
openaire +2 more sources
Cleaning Interval Graphs [PDF]
We investigate a special case of the Induced Subgraph Isomorphism problem, where both input graphs are interval graphs. We show the NP-hardness of this problem, and we prove fixed-parameter tractability of the problem with non-standard parameterization, where the parameter is the difference |V(G)|-|V(H)|, with G and H being the larger and the smaller ...
Dániel Marx, Ildikó Schlotter
openaire +3 more sources

