Results 101 to 110 of about 850,474 (224)
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
To Prove Four Color Theorem [PDF]
, 2016 In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to color and test
Cao, Weiwei, Yue, Weiya
core
Drawing outerplanar graphs using three edge lengths
Computational Geometry, 2015 It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmovic, Morin and Wood.
Ohad N. Feldheim, Noga Alon
openaire +4 more sources
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate
, 2017 Motivated by applications in distributed storage, the storage capacity of a graph was recently defined to be the maximum amount of information that can be stored across the vertices of a graph such that the information at any vertex can be recovered from
Mazumdar, Arya +2 more
core +1 more source
Connected Graph Searching in Outerplanar Graphs
Electronic Notes in Discrete Mathematics, 2005 Search games are a powerfull tool for studying various connectivity parameters of graphs. In the classical search game, we consider an undirected graph G = (V, E) whose edges are initially contaminated. A set of searchers try to clean the graph. At the beginning the graph contains no searchers.
Ioan Todinca +2 more
openaire +2 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
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
Counting Rules for Computing the Number of Independent Sets of a Grid Graph
MathematicsThe issue of counting independent sets of a graph, G, represented as i(G), is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics, and
Guillermo De Ita Luna +2 more
semanticscholar +1 more source
Convex-Arc Drawings of Pseudolines [PDF]
, 2016 A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once.
Eppstein, David +3 more
core +1 more source
The outerplanar crossing number of the complete bipartite graph
Discrete Applied Mathematics, 2022 B. Ábrego, S. Fernández-Merchant
semanticscholar +1 more source