The following pages link to Eduardo Rivera-Campo (Q202558):
Displaying 50 items.
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058) (← links)
- (Q427896) (redirect page) (← links)
- On the acyclic disconnection of multipartite tournaments (Q427897) (← links)
- Spanning trees with small degrees and few leaves (Q452956) (← links)
- Distance 2-domination in prisms of graphs (Q521756) (← links)
- Edge guarding polyhedral terrains (Q676574) (← links)
- A sufficient condition for the existence of plane spanning trees on geometric graphs (Q714896) (← links)
- Illuminating rectangles and triangles on the plane (Q757841) (← links)
- On a heterochromatic number for hypercubes (Q932668) (← links)
- Spanning trees with bounded degrees (Q1180410) (← links)
- Separating convex sets in the plane (Q1184162) (← links)
- On separation of plane convex sets (Q1209727) (← links)
- A note on covering the edges of a graph with bonds (Q1292867) (← links)
- Guarding rectangular art galleries (Q1326753) (← links)
- Separation of convex sets (Q1329792) (← links)
- Protecting convex sets (Q1343224) (← links)
- Euler tours and a game with dominoes (Q1356489) (← links)
- A note on matchings and spanning trees with bounded degrees (Q1359373) (← links)
- On circumscribing polygons for line segments (Q1388139) (← links)
- On a tree graph defined by a set of cycles (Q1408887) (← links)
- On the perfect matching graph defined by a set of cycles (Q1694978) (← links)
- The basis graph of a bicolored matroid (Q1759845) (← links)
- A note on convex decompositions of a set of points in the plane (Q1889830) (← links)
- Illuminating high-dimensional convex sets (Q1900056) (← links)
- On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- A note on spanning trees with a specified degree sequence (Q2188994) (← links)
- Convex dominating sets in maximal outerplanar graphs (Q2312656) (← links)
- On local transformations in plane geometric graphs embedded on small grids (Q2462732) (← links)
- Partitions of complete geometric graphs into plane trees (Q2489020) (← links)
- Graphs of triangulations and perfect matchings (Q2573802) (← links)
- On the basis graph of a bicolored matroid (Q2840548) (← links)
- Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs (Q2847917) (← links)
- (Q3139712) (← links)
- A counterexample to a result on the tree graph of a graph (Q3451465) (← links)
- On the tree graph of a connected graph (Q3633842) (← links)
- (Q3752422) (← links)
- (Q4504015) (← links)
- (Q4504031) (← links)
- (Q4694723) (← links)
- (Q4734663) (← links)
- (Q4817650) (← links)
- A note on minimally 3-connected graphs (Q4823299) (← links)
- A note on coverings of plane graphs (Q4857443) (← links)
- Notes on the Twisted Graph (Q4899270) (← links)
- On conjectures of Frankl and El‐Zahar (Q5387020) (← links)
- (Q5463597) (← links)
- Graph Drawing (Q5711639) (← links)
- Convex Polygons and Separation of Convex (Q5870601) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901263) (← links)
