The following pages link to José Ramón Portillo (Q546276):
Displaying 18 items.
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- (Q662916) (redirect page) (← links)
- Entanglement in eight-qubit graph states (Q662917) (← links)
- (Q1348374) (redirect page) (← links)
- Single bend wiring on surfaces (Q1348375) (← links)
- Irreducible triangulations of the once-punctured torus (Q1669908) (← links)
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points (Q2350591) (← links)
- Quantum state-independent contextuality requires 13 rays (Q2826706) (← links)
- Monochromatic geometric k-factors in red-blue sets with white and Steiner points (Q2851455) (← links)
- Cover contact graphs (Q2968088) (← links)
- (Q3606145) (← links)
- (Q4474130) (← links)
- Memory cost of quantum contextuality (Q5135222) (← links)
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming (Q5215753) (← links)
- Cover Contact Graphs (Q5452221) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)
- Irreducible triangulations of the once-punctured torus (Q6267041) (← links)
- Hypergraphs in logic programming (Q6587942) (← links)
