Determining connectedness from subdigraphs

DOI10.1016/0095-8956(74)90046-XzbMATH Open0267.05106MaRDI QIDQ2562869FDOQ2562869

Authors: Bennet Manvel 

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the problem of reconstructing a tournament from subtournaments
• Reconstructing the degree pair sequence of a digraph
• On nonreconstructable tournaments

Cited In (2)

• A census of non-reconstructable digraphs. I: Six related families
• On a new digraph reconstruction conjecture

This page was built for publication: Determining connectedness from subdigraphs

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