The following pages link to Martin Matamala (Q186122):
Displayed 10 items.
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5443382) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710797) (← links)
- Navigating in a Graph by Aid of Its Spanning Tree Metric (Q5894322) (← links)
- Some remarks on cycles in graphs and digraphs (Q5936027) (← links)
- Graphs with no induced house nor induced hole have the de Bruijn–Erdös property (Q6081879) (← links)
- Lines in bipartite graphs and in 2‐metric spaces (Q6134645) (← links)
- Wide enough Latin rectangles are perfects (Q6261202) (← links)
- Lines in metric spaces: universal lines counted with multiplicity (Q6299282) (← links)
- Lines in quasi-metric spaces with four points (Q6411417) (← links)
- The Minimum Clique Routing Problem on Cycles (Q6459687) (← links)