On the bandwidth conjecture for 3-colourable graphs

zbMATH Open1302.05121MaRDI QIDQ2934645FDOQ2934645

Authors: Julia Böttcher, M. Schacht, Anusch Taraz 

Publication date: 18 December 2014

Recommendations

• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• The bandwidth theorem for locally dense graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• Embedding spanning subgraphs of small bandwidth
• Forcing spanning subgraphs via Ore type conditions

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (3)

• Embedding spanning bipartite graphs of small bandwidth
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós

This page was built for publication: On the bandwidth conjecture for \(3\)-colourable graphs

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