Vertices with the second neighborhood property in Eulerian digraphs

DOI10.7494/OpMath.2019.39.6.765zbMath1437.05126arXiv1711.01189OpenAlexW3098023011MaRDI QIDQ5106690

Michael Cary

Publication date: 22 April 2020

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01189

zbMATH Keywords

cycle decompositionEulerian digraphsecond neighborhood conjecturecycle intersection graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Cycle intersection graphs and minimum decycling sets of even graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of Seymour vertices in random tournaments and digraphs
• Second neighborhood via first neighborhood in digraphs
• The second neighbourhood for quasi-transitive oriented graphs
• Circuit Double Cover of Graphs
• Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• On expansive and anti-expansive tree maps
• Cycle intersection graphs and minimum decycling sets of even graphs
• Remarks on the second neighborhood problem

This page was built for publication: Vertices with the second neighborhood property in Eulerian digraphs