Graphs critically without duo

DOI10.1016/J.CRMA.2009.03.008zbMath1168.05032OpenAlexW2091219439MaRDI QIDQ1018107

Abdeljelil Salhi, Youssef Boudabbous

Publication date: 13 May 2009

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2009.03.008

zbMATH Keywords

intervaldigraphtournamentcritical withoutz duoduo

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Critically twin primitive 2-structures

Cites Work

• Indecomposability graph and critical vertices of an indecomposable graph
• Indecomposable graphs
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Tournaments without acyclic interval.
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs critically without duo