Pages that link to "Item:Q276208"
From MaRDI portal
The following pages link to Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208):
Displaying 12 items.
- Enumerating degree sequences in digraphs and a cycle--cocycle reversing system (Q875070) (← links)
- Chip firing and the Tutte polynomial (Q1387615) (← links)
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs (Q1679328) (← links)
- A maximizing characteristic for critical configurations of chip-firing games on digraphs (Q1801042) (← links)
- The Tutte polynomial as a growth function (Q1818371) (← links)
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method (Q2106620) (← links)
- Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle (Q2339177) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- CoEulerian graphs (Q2802106) (← links)
- (Q4331212) (← links)
- Root polytopes and Jaeger‐type dissections for directed graphs (Q6074977) (← links)
- A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids (Q6543051) (← links)
