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

The generation of maximal triangle-free graphs

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

zbMath0959.05060MaRDI QIDQ1576571

Thomas Harmuth, Stephan Brandt, Gunnar Brinkmann

Publication date: 20 April 2001

Published in: Graphs and Combinatorics (Search for Journal in Brave)


zbMATH Keywords

enumerationgeneration algorithmmaximal triangle-free graphstriangle Ramsey numbers


Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (2)

Almost-equidistant sets ⋮ The local density of triangle-free graphs







This page was built for publication: The generation of maximal triangle-free graphs

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