1 citations · 1 across the 9 of their papers we have counts for
3 papers · 1 filter
On Computational Aspects of Cores of Ordered Graphs
Michal Čertík, Andreas Emil Feldmann, Jaroslav Nešetřil +1
An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We…
On Computational Aspects of Ordered Matching Problems
Michal Čertík, Andreas Emil Feldmann, Jaroslav Nešetřil +1
Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their…
Complexity Aspects of Homomorphisms of Ordered Graphs
Michal Čertík, Andreas Emil Feldmann, Jaroslav Nešetřil +1
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corres…