Buscar
Mostrando ítems 11-20 de 31
Artículo
Contractors for flows
(Elsevier, 2011)
We answer a question raised by Lovász and B. Szegedy [Contractors and connectors in graph algebras, J. Graph Theory 60:1 (2009)] asking for a contractor for the graph parameter counting the number of B-flows of a graph, ...
Artículo
Artículo
The determining number of Kneser graphs
(2013)
A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G is the minimum cardinality of a determining set of G. This paper studies ...
Artículo
Stabbing segments with rectilinear objects
(Elsevier, 2017)
Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for ...
Artículo
On Hamiltonian alternating cycles and paths
(Elsevier, 2018)
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required ...
Artículo
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
(2009)
We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible to find a k-factor we make use of auxiliary points: white points, whose position is given as a datum ...
Artículo
New results on the robust coloring problem
(Springer, 2024-03-23)
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This ...
Artículo
Computing the Tutte polynomial of Archimedean tilings
(2014)
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method for computing the Tutte ...
Artículo
Hexagonal Tilings and Locally C6 Graphs
(Cornell University, 2005)
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle (see [12]). We also show that locally grid graphs, ...
Artículo
Resolving sets for Johnson and Kneser graphs
(2013)
A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, there exists x∈Sx∈S such that the distances d(u,x)≠d(v,x)d(u,x)≠d(v,x). In this paper, we consider the Johnson graphs J(n,k)J(n,k) ...