Recognizing indecomposability for tournaments
From MaRDI portal
Publication:4963201
zbMATH Open1400.05095MaRDI QIDQ4963201FDOQ4963201
Nadia El Amri, Imed Boudabbous, Rim Ben Hamadou
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/
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
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- The falsity of the reconstruction conjecture for tournaments
- Transitiv orientierbare Graphen
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Title not available (Why is that?)
- Minimal indecomposable graphs
- Primitivity is hereditary for 2-structures
- Indecomposability graph and critical vertices of an indecomposable graph
- Critical and infinite directed graphs
- Title not available (Why is that?)
- The \((-1)\)-critically duo-free tournaments.
- Indecomposability graph and indecomposability recognition
- Growing without cloning
- Title not available (Why is that?)
- Finite tournaments with a nonempty diamonds' support
- \((-1)\)-critical graphs.
- Tournaments whose indecomposability graph admits a vertex cover of size 2.
- Graphs whose indecomposability graph is 2-covered
Cited In (4)
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)
