Decomposition of infinite labeled 2-structures

DOI10.1007/3-540-58131-6_44MaRDI QIDQ6183602zbMATH OpenOpenAlexFDO

Authors Tero Harju, Grzegorz Rozenberg

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 labelling (graceful graphs, bandwidth, etc.) (05C78) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Characterization and complexity of uniformly nonprimitive labeled 2-structures
• Prime 2-structures
• Primitivity is hereditary for 2-structures
• Critically twin primitive 2-structures
• scientific article; zbMATH DE number 591000

Cites work

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

Cited in

(4)

• F3-Reconstruction and Bi-Founded 2-Structures
• Prime 2-structures
• Hereditary classes of ordered sets of width at most two
• Siblings of countable cographs

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)