17 citations · 36 across the 19 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DM2021
Graphs where Search Methods are Indistinguishable
Matjaž Krnc, Nevena Pivač
Graph searching is one of the simplest and most widely used tools in graph algorithms. Every graph search method is defined using some particular selection rule, and the analysis o…
math.CO2021★ 1 cited
Graphs with at most two moplexes
Clément Dallard, Robert Ganian, Meike Hatzel +2
A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two mopl…