BE-diperfect digraphs with stability number two

DOI10.37236/12828zbMATH Open1543.05065MaRDI QIDQ6574382

Cândida Nunes da Silva, Caroline Aparecida de Paula Silva, O. Lee

Publication date: 18 July 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

stability numberoptimal coloringmaximum stable setanti-directed odd cyclepath-partition

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The strong perfect graph theorem
• Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
• Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
• Sur les arborescences dans un graphe oriente
• Covering digraphs by paths
• Every finite strongly connected digraph of stability 2 has a Hamiltonian path
• Diperfect graphs
• Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
• \(\alpha\)-diperfect digraphs
• Some results on Berge's conjecture and begin-end conjecture
• Ein kombinatorischer Satz.
• Path Partitions in Directed Graphs
• A family of counterexamples for a conjecture of Berge on \(\alpha\)-diperfect digraphs

This page was built for publication: BE-diperfect digraphs with stability number two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574382)