Pages that link to "Item:Q5897544"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897544):
Displayed 5 items.
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width (Q3010427) (← links)
- Leaves for packings with block size four (Q5000309) (← links)
- Bipartite graphs as polynomials and polynomials as bipartite graphs (Q5162789) (← links)
- A Most General Edge Elimination Polynomial (Q5302041) (← links)