scientific article; zbMATH DE number 4183452
From MaRDI portal
Publication:5749319
zbMath0718.05041MaRDI QIDQ5749319
No author found.
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (only showing first 100 items - show all)
Colouring graphs with no induced six-vertex path or diamond ⋮ Disjointness graphs of segments in the space ⋮ Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ Improved bounds for colouring circle graphs ⋮ On the Ramsey Property of Families of Graphs ⋮ Vizing bound for the chromatic number on some graph classes ⋮ List coloring in the absence of two subgraphs ⋮ The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor ⋮ The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices ⋮ Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs ⋮ On sensitivity in bipartite Cayley graphs ⋮ The Structure of $I_4$-Free and Triangle-Free Binary Matroids ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ On the chromatic number of (\(P_6\), diamond)-free graphs ⋮ Decomposing and colouring some locally semicomplete digraphs ⋮ Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree ⋮ THE CHROMATIC NUMBER OF -FREE GRAPHS ⋮ The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ On graphs with no induced five‐vertex path or paraglider ⋮ Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Polynomial bounds for chromatic number. III. Excluding a double star ⋮ Coloring of some crown-free graphs ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ Induced odd cycle packing number, independent sets, and chromatic number ⋮ An optimal χ‐bound for (P6, diamond)‐free graphs ⋮ (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels ⋮ Caterpillars in Erdős-Hajnal ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ Coloring circle graphs ⋮ Coloring graphs without induced \(P_5\) or \(K_5-e\) ⋮ Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs ⋮ Chromatic bounds for some subclasses of \((P_3\cup P_2)\)-free graphs ⋮ Bounds for the chromatic number of some \(pK_2\)-free graphs ⋮ Problems close to my heart ⋮ A note on the Gyárfás-Sumner conjecture ⋮ On the chromatic number of (P5,dart)-free graphs ⋮ Coloring of a superclass of \(2K_2\)-free graphs ⋮ Coloring graphs with no induced five‐vertex path or gem ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs ⋮ Strengthening Brooks' chromatic bound on \(P_6\)-free graphs ⋮ Disjointness graphs of short polygonal chains ⋮ Treewidth versus clique number. II: Tree-independence number ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph ⋮ Burling graphs revisited. III: Applications to \(\chi \)-boundedness ⋮ Clique-Width for Graph Classes Closed under Complementation ⋮ Coloring (\(P_5\), kite)-free graphs with small cliques ⋮ Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs ⋮ Coloring triangle-free L-graphs with \(O (\log \log n)\) colors ⋮ Hitting all maximum stable sets in \(P_5\)-free graphs ⋮ A Generalization of $$\chi $$-Binding Functions ⋮ Near optimal colourability on hereditary graph families ⋮ Graphs of large chromatic number ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs ⋮ Polynomial bounds for chromatic number VI. Adding a four-vertex path ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ On classes of minimal circular-imperfect graphs ⋮ Unnamed Item ⋮ Approximately coloring graphs without long induced paths ⋮ On induced colourful paths in triangle-free graphs ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ On low rank-width colorings ⋮ The structure and the number of \(P_7\)-free bipartite graphs ⋮ On the chromatic number of (P_{5},windmill)-free graphs ⋮ Two cases of polynomial-time solvability for the coloring problem ⋮ Isolating Highly Connected Induced Subgraphs ⋮ Vertex elimination orderings for hereditary graph classes ⋮ Unnamed Item ⋮ The Erdös--Hajnal Conjecture for Long Holes and Antiholes ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ $(2P_2,K_4)$-Free Graphs are 4-Colorable ⋮ Colouring graphs with no induced six-vertex path or diamond ⋮ A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS ⋮ Coloring a set of touching strings ⋮ Cuts and bounds ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Triangle-free graphs and forbidden subgraphs ⋮ Bounded clique cover of some sparse graphs ⋮ Induced subgraphs of graphs with large chromatic number. IX: Rainbow paths ⋮ Intersection graphs of L-shapes and segments in the plane ⋮ Chromatic number of \(P_5\)-free graphs: Reed's conjecture ⋮ Square-free graphs with no induced fork ⋮ Chromatic bounds for the subclasses of \(pK_2\)-free graphs ⋮ A dichotomy theorem for circular colouring reconfiguration ⋮ Proper orientation of cacti ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs ⋮ On the chromatic number of \(2 K_2\)-free graphs ⋮ On the structure of certain intersection graphs ⋮ On the chromatic number of some \(P_5\)-free graphs ⋮ Fractional Turan's theorem and bounds for the chromatic number ⋮ Covering and coloring polygon-circle graphs ⋮ Induced subgraphs of graphs with large chromatic number. I. Odd holes ⋮ Star chromatic bounds ⋮ On graphs without \(P_ 5\) and \(\overline {P}_ 5\) ⋮ Maximum induced matchings in graphs ⋮ Coloring graph classes with no induced fork via perfect divisibility ⋮ Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions ⋮ Applications of hypergraph coloring to coloring graphs not inducing certain trees
This page was built for publication:
