On enumerating paths of K arcs in unoriented complete graphs

DOI10.1016/0016-0032(75)90086-1MaRDI QIDQ1219305zbMATH OpenOpenAlexFDO

Authors Eugene Radwin, Samuel D. Bedrosian

Publication date 1975

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(75)90086-1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3227009 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 3353287 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• scientific article; zbMATH DE number 3194439 (Why is no real title available?)
• scientific article; zbMATH DE number 3194440 (Why is no real title available?)
• Generating formulas for the number of trees in a graph
• Graphs, dynamic programming, and finite games
• Principles of combinatorics
• Synthesis of Switching Functions by Linear Graph Theory

This page was built for publication: On enumerating paths of K arcs in unoriented complete graphs

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