On a property of the class of n-colorable graphs
From MaRDI portal
Publication:2563166
Cites work
Cited in
(only showing first 100 items - show all)- A fast parallel algorithm to recognize P4-sparse graphs
- The allocation problem in hardware design
- A New Characterization of P 6-Free Graphs
- Excluding pairs of graphs
- On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph
- Two-colourings that decompose perfect graphs
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
- On 3‐graphs with no four vertices spanning exactly two edges
- Structure and coloring of a family of (P₇, C₅)-free graphs
- On the complexity of role colouring planar graphs, trees and cographs
- Towards the Erdős-Hajnal conjecture for P₅-free graphs
- Murky graphs
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Functions that are read-once on a subset of their inputs
- Processor optimization for flow graphs
- On the \(b\)-dominating coloring of graphs
- Colouring square-free graphs without long induced paths
- On the spectrum of threshold graphs
- Complexity of total dominator coloring in graphs
- Structure and coloring of (P₇, C₅, diamond)-free graphs
- Infinite versus finite graph domination
- Generalizing cographs to 2-cographs
- Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the \(H_{6}\)-conjecture
- Cograph editing: Merging modules is equivalent to editing P₄s
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- The Erdős-Hajnal conjecture for rainbow triangles
- The setup polyhedron of series-parallel posets
- Locally perfect graphs
- Wings and perfect graphs
- Coupon coloring of cographs
- Primitivity is hereditary for 2-structures
- A characterization of claw-free \(b\)-perfect graphs
- Forbidden pairs and the existence of a dominating cycle
- On the vertex packing problem
- Graphs with few trivial characteristic ideals
- Geometry and Combinatorics via Right-Angled Artin Groups
- Some progress on the Aharoni-Korman conjecture
- Recognition of chordal graphs and cographs which are cover-incomparability graphs
- Bull-free Berge graphs are perfect
- A bipartite analogue of Dilworth's theorem
- Minimal colorings for properly colored subgraphs
- scientific article; zbMATH DE number 2230325 (Why is no real title available?)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Colouring of (P₃ P₂)-free graphs
- Some perfect coloring properties of graphs
- Graph classes and forbidden patterns on three vertices
- Complement reducible graphs
- Faster algorithms for cograph edge modification problems
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
- Chromatic bounds for some classes of 2 K₂-free graphs
- Completely separable graphs
- On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
- Counting Small Induced Subgraphs Satisfying Monotone Properties
- Characterizing forbidden pairs for relative length of longest paths and cycles
- Sequential colorings and perfect graphs
- Scheduling of conditional executed jobs on unrelated processors
- The robust chromatic number of graphs
- Base polytopes of series-parallel posets: Linear description and optimization
- Graph theory (algorithmic, algebraic, and metric problems)
- The Erdős-Hajnal conjecture. A survey
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- Towards optimal -binding functions of (2K₁ K₂)-free graphs and (P₃ K₁)-free graphs
- Obstructions for three-coloring and list three-coloring H-free graphs
- The price of connectivity for dominating set: upper bounds and complexity
- Graphs obtained by disjoint unions and joins of cliques and stable sets
- Defective Coloring on Classes of Perfect Graphs
- Spectral properties of \(\mathcal{C}\)-graphs
- Complete description of forbidden subgraphs in the structural domination problem
- More on discrete convexity
- On \(r\)-hued colorings of graphs without short induced paths
- On minimal imperfect graphs without induced P₅
- Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
- Dominating cliques in \(P_ 5\)-free graphs
- Dominator and total dominator colorings in graphs
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
- Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
- -boundedness and related problems on graphs without long induced paths: a survey
- An optimal path cover algorithm for cographs
- Cographs: eigenvalues and Dilworth number
- Colouring square-free graphs without long induced paths
- The signature of chordal graphs and cographs
- Chair-free Berge graphs are perfect
- Triangle-free graphs and forbidden subgraphs
- Structure and linear-Pollyanna for some square-free graphs
- Almost controllable graphs and beyond
- Characterization of \(P_{6}\)-free graphs
- Structure of some ( P₇, C₄)-free graphs with application to colorings
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- A tree representation for \(P_ 4\)-sparse graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Cographs and 1-sums
- Vizing bound for the chromatic number on some graph classes
- Partition refinement techniques: an interesting algorithmic tool kit
- Star coloring of certain graph classes
- Spectral properties of cographs and P₅-free graphs
- Competitive graph searches
- Paired-domination in \(P_{5}\)-free graphs
This page was built for publication: On a property of the class of n-colorable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563166)
