Markov bases of binary graph models of K::4::-minor free graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Daniel Král, Serguei Norine, Ondrej Pangrác. Markov bases of binary graph models of K::4::-minor free graphs. Journal of Combinatorial Theory, Series A, 117(6):759-765, 2010. [doi]

The following publications are possibly variants of this publication:

Distance Constrained Labelings of K::4::-minor Free GraphsDaniel Král, Pavel Nejedlý. endm, 28:549-556, 2007. [doi]

Toughness threshold for the existence of 2-walks in K::4::-minor-free graphsZdenek Dvorak, Daniel Král, Jakub Teska. DM, 310(3):642-651, 2010. [doi]

Distance constrained labelings of K::4::-minor free graphsDaniel Král, Pavel Nejedlý. DM, 309(18):5745-5756, 2009. [doi]

runs on WebDSL