A note on triangle-free and bipartite graphs
From MaRDI portal
Publication:1850031
DOI10.1016/S0012-365X(02)00511-3zbMath1008.05077MaRDI QIDQ1850031
Angelika Steger, Hans Jürgen Prömel, Thomas Schickinger
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
Related Items
On a cycle partition problem, Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time, Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time, Independent sets in \((P_4+P_4\),triangle)-free graphs, Speeding up Exact Algorithms With High Probability, On the Number of 2-SAT Functions