The following pages link to A. Márquez (Q298636):
Displaying 50 items.
- (Q186092) (redirect page) (← links)
- Computing the Tutte polynomial of Archimedean tilings (Q279654) (← links)
- The difference between the metric dimension and the determining number of a graph (Q298637) (← links)
- Stabbers of line segments in the plane (Q543793) (← links)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- Compatible geometric matchings (Q924079) (← links)
- Local refinement based on the 7-triangle longest-edge partition (Q1025330) (← links)
- Geometric tree graphs of points in convex position (Q1289020) (← links)
- On the connectivity of infinite graphs and 2-complexes (Q1297466) (← links)
- A link between Menger's theorem and infinite Euler graphs (Q1307372) (← links)
- Single bend wiring on surfaces (Q1348375) (← links)
- The center of an infinite graph (Q1356406) (← links)
- On the planarity of infinite 2-complexes (Q1378242) (← links)
- (Q1613528) (redirect page) (← links)
- Diagonal flips in outer-triangulations on closed surfaces (Q1613529) (← links)
- Tripartite version of the Corrádi-Hajnal theorem (Q1613547) (← links)
- Hamiltonian triangular refinements and space-filling curves (Q1624615) (← links)
- Locally grid graphs: Classification and Tutte uniqueness (Q1810656) (← links)
- Remarks on the bondage number of planar graphs (Q1861243) (← links)
- An aperiodic tiles machine (Q1862121) (← links)
- On the Turán number of triple systems (Q1865386) (← links)
- Resolving sets for Johnson and Kneser graphs (Q1940362) (← links)
- Computing optimal shortcuts for networks (Q2001454) (← links)
- There are simple and robust refinements (almost) as good as Delaunay (Q2229908) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points (Q2350591) (← links)
- On the metric dimension, the upper dimension and the resolving number of graphs (Q2446323) (← links)
- A new 2D tessellation for angle problems: the polar diagram (Q2489015) (← links)
- Rebuilding convex sets in graphs (Q2566140) (← links)
- Computational geometry on surfaces. Performing computational geometry on the cylinder, the sphere, the torus, and the cone (Q2770062) (← links)
- Monochromatic geometric \(k\)-factors in red-blue sets with white and Steiner points (Q2851455) (← links)
- Cover contact graphs (Q2968088) (← links)
- (Q2968994) (← links)
- Transforming Triangulations on Nonplanar Surfaces (Q3008010) (← links)
- (Q3011770) (← links)
- (Q3118079) (← links)
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration (Q3163728) (← links)
- Dilation-free graphs in thel1 metric (Q3428915) (← links)
- Infinite graph embeddings on tubular surfaces (Q3438942) (← links)
- (Q3606140) (← links)
- (Q3625858) (← links)
- (Q3790325) (← links)
- (Q4264189) (← links)
- On infinite outerplanar graphs (Q4321836) (← links)
- (Q4474130) (← links)
- The Size of a Graph Without Topological Complete Subgraphs (Q4490786) (← links)
- (Q4501713) (← links)
- Triangle-Free Planar Graphs and Segment Intersection Graphs (Q4540532) (← links)
- SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES (Q4650094) (← links)
- Extremal Graphs without Topological Complete Subgraphs (Q4652645) (← links)
