Ramsey numbers of ordered graphs

Jan Kyncl
2020
Journal paper

Abstract

An ordered graph is a pair G = (G,

Official source

https://infoscience.epfl.ch/record/275734?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

About
Privacy
Disclaimer

Ramsey numbers of ordered graphs

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

A full characterization of invariant embeddability of unimodular planar graphs

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al.

A full characterization of invariant embeddability of unimodular planar graphs