Tournaments whose indecomposability graph admits a vertex cover of size 2.

MaRDI QIDQ2829069zbMATHFDO

Authors Imed Boudabbous

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

intervalindecomposable tournamentindecomposability graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12)

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)

• scientific article; zbMATH DE number 7297127 (Why is no real title available?)
• Indecomposable tournaments and their indecomposable subtournaments with six vertices
• Recognizing indecomposability for tournaments
• The \(C_{3}\)-structure of the tournaments.
• Primality, criticality and minimality problems in trees
• Irreducible pairings and indecomposable 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)