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

zbMATH Open1413.05134MaRDI QIDQ2829069FDOQ2829069

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)

Cited In (4)

• Title not available (Why is that?)
• Primality, criticality and minimality problems in trees
• Title not available (Why is that?)
• The \(C_{3}\)-structure of the tournaments.

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Indecomposable tournaments and their indecomposable subtournaments with six vertices 👍 👎
• Some unavoidable subdigraphs of tournaments 👍 👎
• Indecomposable tournaments and their indecomposable subtournaments on 5 vertices 👍 👎
• Title not available (Why is that?) 👍 👎
• All 2-connected in-tournaments that are cycle complementary 👍 👎

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)