Results 51 to 60 of about 3,679 (179)

Minimal Cycle Bases of Outerplanar Graphs [PDF]

The Electronic Journal of Combinatorics, 1998
2-connected outerplanar graphs have a unique minimal cycle basis with length $2\vert E\vert-\vert V\vert$. They are the only Hamiltonian graphs with a cycle basis of this length.
Leydold, Josef, Stadler, Peter F.
openaire   +5 more sources

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

On the Planarity of Generalized Line Graphs

Theory and Applications of Graphs, 2019
One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah, Mohra Zayed, Ping Zhang   +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

Outerplanar Partitions of Planar Graphs

Journal of Combinatorial Theory, Series B, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Small Area Drawings of Outerplanar Graphs [PDF]

Algorithmica, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DI BATTISTA, Giuseppe, FRATI, FABRIZIO
openaire   +1 more source

A Polynomial-time Algorithm for Outerplanar Diameter Improvement

, 2014
The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$.
Cohen, Nathann, Gonçalves, Daniel, Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M., Weller, Mathias   +6 more
core   +3 more sources

Face Sizes and the Connectivity of the Dual

Journal of Graph Theory, Volume 110, Issue 4, Page 379-391, December 2025.
ABSTRACT For each c ≥ 1, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c‐connected maps. Using these bounds, we determine the smallest genus on which a c‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c‐connected map can ...
Gunnar Brinkmann, Kenta Noguchi, Heidi Van den Camp   +2 more
wiley   +1 more source

Fuzzy Outerplanar Graphs and Its Applications

International Journal of Computational Intelligence Systems
The concept of a crisp graph is essential in the study of outerplanar graphs because outerplanar graphs are a unique type of planar graphs containing special characteristics. One of the core concepts of crisp graphs, the notion of a subgraph, is utilized
Deivanai Jaisankar, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 more
doaj   +1 more source

On edge-group choosability of graphs [PDF]

, 2011
In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given.
Khamseh, Amir, Omidi, Gholamreza
core