3 citations · 3 across the 2 of their papers we have counts for
4 papers
Colouring negative exact-distance graphs of signed graphs
Reza Naserasr, Patrice Ossona de Mendez, Daniel A. Quiroz +2
The -th exact-distance graph, of a graph has as its vertex set, and as an edge if and only if the distance between and is (exactly) in . We consid…
Universality in minor-closed graph classes
Tony Huynh, Bojan Mohar, Robert Šámal +2
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). János Pa…
Flow-critical graphs
Arnbjörg SoffÃa Ãrnadóttir, ZdenÄk DvoÅák, Bernard Lidický +3
Lovász et al. proved that every -edge-connected graph has a nowhere-zero -flow. In fact, they proved a more technical statement which says that there exists a nowhere zero $…
Nowhere-zero 8-flows in 3-edge-connected signed graphs
Matt DeVos, Kathryn Nurse, Robert Šámal
In 1983, A. Bouchet extended W.T. Tutte's notion of nowhere-zero flows to signed graphs, and conjectured that every flow-admissible signed graph has a nowhere-zero 6-flow. In this…