Results 101 to 110 of about 1,769 (162)

On Colorings of Squares of Outerplanar Graphs

, 2007
24 pages, 17 ...
Geir Agnarsson, Magnús M. Halldórsson
openaire   +3 more sources

A Survey of Maximal k-Degenerate Graphs and k-Trees

Theory and Applications of Graphs
This article surveys results on maximal $k$-degenerate graphs, $k$-trees, and related classes including simple $k$-trees, $k$-paths, maximal outerplanar graphs, and Apollonian networks.
Allan Bickle
doaj   +1 more source

On Vertices Enforcing a Hamiltonian Cycle

Discussiones Mathematicae Graph Theory, 2013
A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian.
Fabrici Igor, Hexel Erhard, Jendrol’ Stanislav   +2 more
doaj   +1 more source

Crosscap of the non-cyclic graph of groups

AKCE International Journal of Graphs and Combinatorics, 2016
The non-cyclic graph CG to a non locally cyclic group G is as follows: take G∖Cyc(G) as vertex set, where Cyc(G)={x∈G|〈x,y〉  is cyclic for all  y∈G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup.
K. Selvakumar, M. Subajini
doaj   +1 more source

The Tutte polynomial characterizes simple outerplanar graphs [PDF]

, 2011
We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar.
Noy, M., de Mier, A, Noble, Steven, M. NOY, Andrew J. Goodall, Noble, S., Noy, M, Mier Vinué, Anna de, A. J. GOODALL, Noble, SD, Goodall, A.J., A. de MIER, de Mier, A., Goodall, AJ, S. D. NOBLE, Anna de Mier, Goodall, Andrew, Noy Serrano, Marcos, Steven D. Noble, Marc Noy   +19 more
core   +2 more sources

The role of twins in computing planar supports of hypergraphs

Journal of Graph Algorithms and Applications
A support or realization of a hypergraph $\mathcal{H}$ is a graph \(G\) on the same vertex set as \(\mathcal{H}\) such that for each hyperedge of $\mathcal{H}$ it holds that its vertices induce a connected subgraph of $G$.
René van Bevern, Iyad Kanj, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge   +4 more
doaj   +1 more source

Approximate realizations for outerplanaric degree sequences

Journal of Computer and System Sciences
We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerplanaric sequence.
Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz   +4 more
openaire   +4 more sources

Network design for bypass roads using interval valued fuzzy outerplanar graphs

Scientific Reports
This paper presents a novel approach to bypass road network design using interval valued fuzzy outerplanar graphs (IVFOGs), addressing the increasing demands of vehicular growth and evolving lifestyles.
Deivanai Jaisankar, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 more
doaj   +1 more source

Counting outerplanar maps

A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice paths.
Geffner, I., Noy Serrano, Marcos
core  

Generating outerplanar graphs uniformly at random

, 2003
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a counting technique using the decomposition of a graph according to its ...
Mihyun Kang, Manuel Bodirsky
core