Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the number of complete subgraphs and circuits in a graph

From MaRDI portal
Publication:5583693
Jump to:navigation, search

DOI10.1098/rspa.1969.0013zbMath0189.24101OpenAlexW2003238751MaRDI QIDQ5583693

David G. Larman

Publication date: 1968

Published in: Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rspa.1969.0013


zbMATH Keywords

topology



Related Items (1)

On the maximum number of cliques in a graph




This page was built for publication: On the number of complete subgraphs and circuits in a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5583693&oldid=30847412"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 13 March 2024, at 15:07.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki