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

Alexander D. Scott

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 caseInduced subgraphs of graphs with large chromatic number. XI. OrientationsScott's Induced Subdivision Conjecture for Maximal Triangle-Free GraphsExcluding Induced Subdivisions of the Bull and Related GraphsInduced subgraphs of graphs with large chromatic number. I. Odd holesThe 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 subgraphsA note on chromatic number and induced odd cyclesPolynomial bounds for chromatic number. I. Excluding a biclique and an induced treeTriangle‐free graphs with large chromatic number and no induced wheelTriangle-free intersection graphs of line segments with large chromatic numberThe chromatic number of {ISK4, diamond, bowtie}‐free graphsMIP formulations for induced graph optimization problems: a tutorialPolynomial bounds for chromatic number II: Excluding a star‐forestPolynomial bounds for chromatic number. III. Excluding a double starSome remarks on graphs with no induced subdivision of \(K_4\)Maximum weighted induced forests and trees: new formulations and a computational comparative reviewExact Solution Algorithms for the Chordless Cycle ProblemLocally bounded coverings and factorial properties of graphsChromatic number and subtrees of graphsAmalgams and χ-BoundednessA note on the Gyárfás-Sumner conjecturePolynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graphBurling graphs revisited. II: StructureBurling graphs revisited. III: Applications to \(\chi \)-boundednessChromatic number of ISK4-free graphsCombinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphsA Generalization of $$\chi $$-Binding FunctionsGraphs of large chromatic numberInduced subgraphs of graphs with large chromatic number. VI. Banana treesOn graphs with no induced subdivision of \(K_4\)Characterization of forbidden subgraphs for bounded star chromatic numberSubstitution and \(\chi\)-boundednessExcluding cycles with a fixed number of chordsPolynomial \(\chi \)-binding functions and forbidden induced subgraphs: a surveyColoring graphs without fan vertex-minors and graphs without cycle pivot-minorsBox and Segment Intersection Graphs with Large Girth and Chromatic NumberInduced subgraphs of graphs with large chromatic number. XIII. New broomsBurling graphs, chromatic number, and orthogonal tree-decompositionsColouring Vertices of Triangle-Free GraphsInduced subgraphs of graphs with large chromatic number. V. Chandeliers and stringsLarge induced trees in \(K_r\)-free graphsBurling graphs, chromatic number, and orthogonal tree-decompositionsInduced cycles and chromatic numberFrom \(\chi\)- to \(\chi_p\)-bounded classesTreewidth versus Clique Number. I. Graph Classes with a Forbidden StructureRestricted frame graphs and a conjecture of Scott




This page was built for publication: