Colouring of graphs with Ramsey-type forbidden subgraphs

DOI10.1007/978-3-642-45043-3_18zbMATH Open1417.68064OpenAlexW1827006176MaRDI QIDQ2864302FDOQ2864302

Authors: Konrad Dabrowski, Petr A. Golovach, Daniël Paulusma 

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14179/1/14179.pdf

Recommendations

• Colouring of graphs with Ramsey-type forbidden subgraphs
• scientific article; zbMATH DE number 2044943
• Coloring graphs characterized by a forbidden subgraph
• Coloring graphs characterized by a forbidden subgraph
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Colouring of graphs with Ramsey-type forbidden subgraphs
• Title not available (Why is that?)
• List coloring in the absence of two subgraphs
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs

This page was built for publication: Colouring of graphs with Ramsey-type forbidden subgraphs

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