Decomposition of infinite labeled 2-structures

DOI10.1007/3-540-58131-6_44zbMATH Open1529.68211OpenAlexW1594935872MaRDI QIDQ6183602FDOQ6183602

Grzegorz Rozenberg, Tero Harju

Publication date: 29 January 2024

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

Full work available at URL: https://doi.org/10.1007/3-540-58131-6_44

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Transitiv orientierbare Graphen
• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• Embedding tournaments in simple tournaments
• Primitivity is hereditary for 2-structures
• A Fast Algorithm for the Decomposition of Graphs and Posets
• Angular 2-structures

Cited In (2)

• Hereditary classes of ordered sets of width at most two
• F3-Reconstruction and Bi-Founded 2-Structures

This page was built for publication: Decomposition of infinite labeled 2-structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183602)