WQO dichotomy for 3-graphs

DOI10.1007/978-3-319-89366-2_30zbMath1496.68233OpenAlexW3021404004MaRDI QIDQ5915688

Sławomir Lasota, Radosław Piórkowski

Publication date: 17 July 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89366-2_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of model theory (03C98)

Related Items (2)

Fast computations on ordered nominal sets ⋮ WQO dichotomy for 3-graphs

This page was built for publication: WQO dichotomy for 3-graphs