Triangle-free graphs without forbidden subgraphs

MaRDI QIDQ2741324zbMATH OpenFDO

Authors Stephan Brandt

Publication date 23 September 2001

Full work available at URL http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Triangle-free graphs and forbidden subgraphs
• A class of three-colorable triangle-free graphs
• Triangle-free graphs with large chromatic numbers
• Chromatic number of triangle-free graphs with some forbidden subgraphs
• Triangle-free 2P₃-free graphs are 4-colorable

Cited in

(6)

• Triangle-free graphs and forbidden subgraphs
• Graphs without theta subgraphs
• Some induced subgraphs of strongly regular graphs with no triangles
• scientific article; zbMATH DE number 1496606 (Why is no real title available?)
• scientific article; zbMATH DE number 1833071 (Why is no real title available?)
• No dense subgraphs appear in the triangle-free graph process

This page was built for publication: Triangle-free graphs without forbidden subgraphs

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