Recognizing indecomposability for tournaments

MaRDI QIDQ4963201zbMATH OpenFDO

Authors Rim Ben Hamadou, Imed Boudabbous, Nadia El Amri

Publication date 6 November 2018

Full work available at URL http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-30-number-4-6-2018/mvlsc-30-4-6-p-419-448/

zbMATH Keywords

intervaldigraphrecognitionindecomposabilitytournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Indecomposable tournaments and their indecomposable subtournaments with six vertices
• Tournaments whose indecomposability graph admits a vertex cover of size 2.
• The indecomposable tournaments T with \(|W_5(T)|=|T|-2\)
• Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
• Critical and infinite tournaments

Cites work

• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 887768 (Why is no real title available?)
• Critical and infinite directed graphs
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Finite tournaments with a nonempty diamonds' support
• Graphs whose indecomposability graph is 2-covered
• Growing without cloning
• Indecomposability graph and critical vertices of an indecomposable graph
• Indecomposability graph and indecomposability recognition
• Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
• Minimal indecomposable graphs
• Primitivity is hereditary for 2-structures
• The \((-1)\)-critically duo-free tournaments.
• The falsity of the reconstruction conjecture for tournaments
• Tournaments whose indecomposability graph admits a vertex cover of size 2.
• Transitiv orientierbare Graphen
• \((-1)\)-critical graphs.

Cited in

(11)

• Decomposability index of tournaments
• Irreducible pairings and indecomposable tournaments
• Partially critical tournaments and partially critical supports
• Decomposability and co-modular indices of tournaments
• Tournaments with maximal decomposability
• Making a tournament indecomposable by one subtournament-reversal operation
• Configurations inévitables dans un tournoi indécomposable
• Indecomposability and duality of tournaments
• Indecomposable tournaments and their indecomposable subtournaments with six vertices
• The indecomposable tournaments T with \(|W_5(T)|=|T|-2\)
• The \(C_{3}\)-structure of the tournaments.

This page was built for publication: Recognizing indecomposability for tournaments

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