The following pages link to Andrea Jiménez (Q299046):
Displaying 18 items.
- Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
- On path decompositions of \(2k\)-regular graphs (Q324765) (← links)
- Cubic bridgeless graphs and braces (Q503640) (← links)
- Maximum number of sum-free colorings in finite abelian groups (Q1659538) (← links)
- (Q1732774) (redirect page) (← links)
- Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776) (← links)
- Polynomial degeneracy for the first \(m\) energy levels of the antiferromagnetic Ising model (Q2031487) (← links)
- Satisfying states of triangulations of a convex \(n\)-gon (Q2380473) (← links)
- On path decompositions of \(2 k\)-regular graphs (Q2400577) (← links)
- Non-degenerated ground states and low-degenerated excited states in the antiferromagnetic Ising model on triangulations (Q2439698) (← links)
- Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings (Q2449125) (← links)
- Counting perfect matchings in the geometric dual (Q2840713) (← links)
- On path-cycle decompositions of triangle-free graphs (Q4560208) (← links)
- Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors (Q4568091) (← links)
- (Q5419957) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5918671) (← links)
- Totally odd immersions in line graphs (Q6117353) (← links)
