Tournaments whose indecomposability graph admits a vertex cover of size 2.
From MaRDI portal
Publication:2829069
zbMATH Open1413.05134MaRDI QIDQ2829069FDOQ2829069
Authors: Imed Boudabbous 
Publication date: 26 October 2016
Published in: Ars Combinatoria (Search for Journal in Brave)
Recommendations
- Graphs whose indecomposability graph is 2-covered
- A characterization of connected \((1,2)\)-domination graphs of tournaments
- On 2-e.c. graphs, tournaments, and hypergraphs
- scientific article; zbMATH DE number 2077659
- Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices
- Indecomposable tournaments and their indecomposable subtournaments with six vertices
- Some unavoidable subdigraphs of tournaments
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices
- scientific article; zbMATH DE number 5077150
- All 2-connected in-tournaments that are cycle complementary
Cited In (6)
- Recognizing indecomposability for tournaments
- Irreducible pairings and indecomposable tournaments
- Title not available (Why is that?)
- Primality, criticality and minimality problems in trees
- Indecomposable tournaments and their indecomposable subtournaments with six vertices
- The \(C_{3}\)-structure of the tournaments.
This page was built for publication: Tournaments whose indecomposability graph admits a vertex cover of size 2.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829069)
