The generation of maximal triangle-free graphs

zbMATH Open0959.05060MaRDI QIDQ1576571FDOQ1576571

Authors: Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth 

Publication date: 20 April 2001

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

Recommendations

• The number of the maximal triangle-free graphs
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Ramsey numbers \(R(K_3, G)\) for graphs of order 10
• Cycle-maximal triangle-free graphs

zbMATH Keywords

enumerationgeneration algorithmmaximal triangle-free graphstriangle Ramsey numbers

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• The local density of triangle-free graphs
• Testing Triangle-Freeness in General Graphs
• Cycle-maximal triangle-free graphs
• Almost-equidistant sets
• On maximal triangle‐free graphs
• Generating weakly triangulated graphs
• Ramsey numbers \(R(K_3, G)\) for graphs of order 10

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

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