Denombrement des arborescences dont le graphe de comparabilite est hamiltonien

DOI10.1016/0012-365X(73)90135-0zbMath0259.05117OpenAlexW1967872290MaRDI QIDQ2560259

J. C. Arditti

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90135-0

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Enumeration under group action: Unsolved graphical enumeration problems, IV
• Correspondences between plane trees and binary sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Denombrement des arborescences dont le graphe de comparabilite est hamiltonien