SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES

DOI10.1112/S0025579310001518zbMath1225.05107arXiv0911.4378MaRDI QIDQ3087001

Robert Brignall, Vincent R. Vatter, Nikola Ruškuc

Publication date: 1 August 2011

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.4378

Mathematics Subject Classification ID

Partial orders, general (06A06) Permutations, words, matrices (05A05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Model theory of finite structures (03C13) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Making a tournament indecomposable by one subtournament-reversal operation ⋮ Editing to prime graphs

Cites Work

• Graph derivatives
• Modular decomposition and transitive orientation
• Indecomposable graphs
• Linear-time modular decomposition of directed graphs
• Embedding tournaments in simple tournaments
• Some remarks on simple tournaments
• On Intervals in Relational Structures
• Graph Classes: A Survey
• Transitiv orientierbare Graphen
• Simple one‐point extensions of tournaments

This page was built for publication: SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES