
Graphs where Search Methods are Indistinguishable
Graph searching is one of the simplest and most widely used tools in gra...
read it

Graphs with at most two moplexes
A moplex is a natural graph structure that arises when lifting Dirac's c...
read it

Fast recognition of some parametric graph families
We identify all [1, λ, 8]cycle regular Igraphs and all [1, λ, 8]cycle...
read it

Shifting paths to avoidable ones
An extension of an induced path P in a graph G is an induced path P' suc...
read it

Fair packing of independent sets
In this work we add a graph theoretical perspective to a classical probl...
read it

Recognizing Graph Search Trees
Graph searches and the corresponding search trees can exhibit important ...
read it

On the EndVertex Problem of Graph Searches
End vertices of graph searches can exhibit strong structural properties ...
read it

Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies
We study the problem of distributed plurality consensus among n nodes, e...
read it
Matjaž Krnc
is this you? claim profile