Results 101 to 110 of about 1,056 (209)
A Survey of Maximal k-Degenerate Graphs and k-Trees
Theory and Applications of GraphsThis 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
The Cayley Sum Graph of Ideals of a Lattice
Discussiones Mathematicae - General Algebra and Applications, 2020 Let L be a lattice, 𝒥(L) be the set of ideals of L and S be a subset of 𝒥 (L). In this paper, we introduce an undirected Cayley graph of L, denoted by ΓL,S with elements of 𝒥 (L) as the vertex set and, for two distinct vertices I and J, I is adjacent to ...
Afkhami Mojgan +2 more
doaj +1 more source
A fast parallel algorithm for optimal edge-colouring of outerplanar graphs [PDF]
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM)
Gibbons, Alan (Alan M.) +1 more
core
Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]
We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.) +2 more
core
Edge covering pseudo-outerplanar graphs with forests
, 2012 A graph is pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another.
Zhang, Xin, Liu, Guizhen, Wu, Jian-Liang
core +1 more source
On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
CoRRBorradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every $n$-vertex $2$-outerplane graph has a set of at least $2n/3$ vertices that induces an outerplane graph. We identify a major flaw in their proof and recover their result with a different, and unfortunately much more complex, proof.
Marco D'Elia, Fabrizio Frati
openaire +2 more sources
A refinement operator for outerplanar graphs
, 2022 S.95-97Outerplanar graphs form a practically relevant class of graphs which appear efficiently computable bottom-up refinement operator for tenuous outerplanar graphs defined by combining techniques from first-order learning, algebraic graph theory, and ...
Horvath, Tamas +2 more
core
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source
On Colorings of Squares of Outerplanar Graphs
, 2007 24 pages, 17 ...
Geir Agnarsson, Magnús M. Halldórsson
openaire +3 more sources
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4
, 2009 A mapping from the vertex set of a graph G=(V,E) into an interval of integers {0,...,k} is an L(2,1)-labelling of G of span k if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common ...
Noble, Steven +8 more
core +1 more source