Two Decomposition Theorems for a Class of Finite Oriented Graphs

DOI10.2307/2372274MaRDI QIDQ5809643zbMATH OpenOpenAlexFDO

Authors R. Duncan Luce

Publication date 1952

Published in American Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b7ef67e24323ea7d1042116a30e1069fc0ceebcf

zbMATH Keywords

topology

Cited in

(5)

• A note on top down and bottom up analysis of strongly connected digraphs
• Some applications of graph theory to clustering
• Spanning subgraphs of k-connected digraphs
• Wheels within wheels
• On the distribution of completion times for random communication in the task-oriented group with a special structure

This page was built for publication: Two Decomposition Theorems for a Class of Finite Oriented Graphs

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