scientific article
From MaRDI portal
Publication:3129824
DOI<297::AID-JGT2>3.0.CO;2-J 10.1002/(SICI)1097-0118(199704)24:4<297::AID-JGT2>3.0.CO;2-JzbMath0876.05036MaRDI QIDQ3129824
Publication date: 22 April 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs ⋮ Excluding Induced Subdivisions of the Bull and Related Graphs ⋮ Induced subgraphs of graphs with large chromatic number. I. Odd holes ⋮ The chromatic number of graphs with no induced subdivision of \(K_4\) ⋮ Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs ⋮ A note on chromatic number and induced odd cycles ⋮ Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree ⋮ Triangle‐free graphs with large chromatic number and no induced wheel ⋮ Triangle-free intersection graphs of line segments with large chromatic number ⋮ The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Polynomial bounds for chromatic number. III. Excluding a double star ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ Maximum weighted induced forests and trees: new formulations and a computational comparative review ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Locally bounded coverings and factorial properties of graphs ⋮ Chromatic number and subtrees of graphs ⋮ Amalgams and χ-Boundedness ⋮ A note on the Gyárfás-Sumner conjecture ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph ⋮ Burling graphs revisited. II: Structure ⋮ Burling graphs revisited. III: Applications to \(\chi \)-boundedness ⋮ Chromatic number of ISK4-free graphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs ⋮ A Generalization of $$\chi $$-Binding Functions ⋮ Graphs of large chromatic number ⋮ Induced subgraphs of graphs with large chromatic number. VI. Banana trees ⋮ On graphs with no induced subdivision of \(K_4\) ⋮ Characterization of forbidden subgraphs for bounded star chromatic number ⋮ Substitution and \(\chi\)-boundedness ⋮ Excluding cycles with a fixed number of chords ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Box and Segment Intersection Graphs with Large Girth and Chromatic Number ⋮ Induced subgraphs of graphs with large chromatic number. XIII. New brooms ⋮ Burling graphs, chromatic number, and orthogonal tree-decompositions ⋮ Colouring Vertices of Triangle-Free Graphs ⋮ Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings ⋮ Large induced trees in \(K_r\)-free graphs ⋮ Burling graphs, chromatic number, and orthogonal tree-decompositions ⋮ Induced cycles and chromatic number ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Restricted frame graphs and a conjecture of Scott
This page was built for publication:
