Sciweavers

990 search results - page 8 / 198
» Sub-Graphs of Complete Graph
Sort
View
JANCL
2002
113views more  JANCL 2002»
15 years 5 months ago
Canonicity and Completeness Results for Many-Valued Modal Logics
We prove frame determination results for the family of many-valued modal logics introduced by M. Fitting in the early '90s. Each modal language of this family is based on a H...
Costas D. Koutras, Christos Nomikos, Pavlos Peppas
171
Voted
DAM
2008
109views more  DAM 2008»
15 years 5 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
163
Voted
JSYML
2010
95views more  JSYML 2010»
15 years 10 days ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
IPL
2008
84views more  IPL 2008»
15 years 5 months ago
Minimal proper interval completions
Given an arbitrary graph G = (V, E) and a proper interval graph H = (V, F) with E F we say that H is a proper interval completion of G. The graph H is called a minimal proper inte...
Ivan Rapaport, Karol Suchan, Ioan Todinca
205
Voted
WG
2010
Springer
15 years 3 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...