Results 101 to 110 of about 2,073 (195)
A polynomial-time algorithm for outerplanar diameter improvement
, 2015 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.
Gonçalves, D. +6 more
core +3 more sources
Indonesian Journal of CombinatoricsA planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3.
Christian Barrientos, Sarah Minion
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 +2 more
doaj +1 more source
Oriented coloring of 2-outerplanar graphs
, 2007 A graph G is 2-outerplanar if it has a planar embedding such that the subgraph obtained by removing the vertices of the outer face is outerplanar. The oriented chromatic number of an oriented graph H is defined as the minimum order of an oriented graph H'
Esperet, Louis, Ochem, Pascal
core
Star Coloring Outerplanar Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2019 A proper coloring of the vertices of a graph is called a star coloring if at least three colors are used on every 4-vertex path. We show that all outerplanar bipartite graphs can be star colored using only five colors and construct the smallest known ...
Ramamurthi Radhika, Sanders Gina
doaj +1 more source
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +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
A graph and its complement with specified properties I: connectivity
International Journal of Mathematics and Mathematical Sciences, 1979 We investigate the conditions under which both a graph G and its complement G¯ possess a specified property. In particular, we characterize all graphs G for which G and G¯ both (a) have connectivity one, (b) have line-connectivity one, (c) are 2 ...
Jin Akiyama, Frank Harary
doaj +1 more source
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
Journal of Graph Algorithms and Applications, 2011 Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (acyclic-HPCCM) to be the problem of determining a hamiltonian path completion set of edges such that, when these edges ...
Tamara Mchedlidze, Antonios Symvonis
doaj +1 more source