Results 101 to 110 of about 4,003 (201)
Minimum rank of outerplanar graphs
Linear Algebra and its Applications, 2012 AbstractThe problem of finding the minimum rank over all symmetric matrices corresponding to a given graph has grown in interest recently. It is well known that the minimum rank of any graph is bounded above by the clique cover number, the minimum number of cliques needed to cover all edges of the graph.
John Sinkovic, Mark Kempton
openaire +2 more sources
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
The edge chromatic number of outer-1-planar graphs [PDF]
, 2014 A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once.
Zhang, Xin
core
Maximum packing for biconnected outerplanar graphs [PDF]
Discrete Applied Mathematics, 1997 A \(G\)-packing of a graph \(H\) is a set of vertex-disjoint subgraphs \(H_{1}, H_{2}, \ldots ,H_{l}\) of \(H\) such that each \(H_{i}\) is isomorphic to \(G\). The problem of maximum \(G\)-packing in \(H\) is to determine the maximum cardinality of a \(G\)-packing of \(H\). In general, the problem is NP-complete, even when \(H\) is a planar graph, and
Tomas Kovac, Andrzej Lingas
openaire +3 more sources
On reconstructing maximal outerplanar graphs
Discrete Mathematics, 1974 Manvel has proved that a maximal outerplanar graph can be reconstructed from the collection of isomorphism types of subgraphs obtained by deleting vertices of the given graph. This paper sharpens Manvel's result by showing that if the graph is not a triangulation of a hexagon, then reconstruction can be accomplished using only those isomorphism types ...
openaire +2 more sources
Journal of Computational Geometry, 2016 We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be ...
David Eppstein +5 more
doaj +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Laskar, R.C., Mulder, H.M., Novick, B.
core +1 more source
A generalization of outerplanar graphs [PDF]
Časopis pro pěstování matematiky, 1988 A planar graph is said to be a generalized outerplanar graph if it has an embedding in the plane in which every edge is incident to a vertex laying on the boundary of the outer face. The author presents a characterization of generalized outerplanar graphs by means of a set of exactly 12 forbidden subgraphs (up to homeomorphism).
openaire +1 more source
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
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