Pages that link to "Item:Q1103634"
From MaRDI portal
The following pages link to The matching polynomial of a polygraph (Q1103634):
Displaying 15 items.
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- On ``The matching polynomial of a polygraph'' (Q689958) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Distance-related invariants on polygraphs (Q1377616) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- Dimer problem for some three dimensional lattice graphs (Q1618987) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- Algebraic approach to fasciagraphs and rotagraphs (Q1917348) (← links)
- A fast numerical method for fractional partial integro-differential equations with spatial-time delays (Q2227760) (← links)
- Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets (Q2457007) (← links)
- An infinite family of graphs with a facile count of perfect matchings (Q2636812) (← links)
- Exact and Approximate Compression of Transfer Matrices for Graph Homomorphisms (Q3091955) (← links)
- Calculating genus polynomials via string operations and matrices (Q4629548) (← links)
- Hosoya index of thorny polymers (Q6140252) (← links)
- On the 2-rainbow independent domination numbers of some graphs (Q6166940) (← links)
