On a property of the class of n-colorable graphs

Cites work

scientific article; zbMATH DE number 3346357 (Why is no real title available?)
Unverschr�nkte Graphen und strategische Spiele in kombinatorischer Form

Cited in

(only showing first 100 items - show all)

Primitivity is hereditary for 2-structures
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Complexity and parameterized algorithms for cograph editing
On semi-\(P_ 4\)-sparse graphs
Characterization of \(P_{6}\)-free graphs
Restrictions of graph partition problems. I
Cycle-maximal triangle-free graphs
Partial characterizations of circle graphs
Two-colourings that decompose perfect graphs
Minimal colorings for properly colored subgraphs
3-colorability and forbidden subgraphs. I: Characterizing pairs
A characterization of claw-free \(b\)-perfect graphs
A note on a paper by D. Seinsche
Graph theory (algorithmic, algebraic, and metric problems)
The strong perfect graph conjecture: 40 years of attempts, and its resolution
On the \(P_4\)-components of graphs
Bull-free Berge graphs are perfect
Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
Square-free perfect graphs.
The inclusion structure of partially lossy queue monoids and their trace submonoids
P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
The Erdős-Hajnal conjecture for rainbow triangles
A bipartite analogue of Dilworth's theorem
A simple linear time algorithm for cograph recognition
On the vertex packing problem
Chromatic bounds for some classes of \(2 K_2\)-free graphs
Complete description of forbidden subgraphs in the structural domination problem
On the structure of bull-free perfect graphs
Dominating cliques in \(P_ 5\)-free graphs
Paired-domination in \(P_{5}\)-free graphs
Graphs defined on groups
Obstructions for three-coloring and list three-coloring \(H\)-free graphs
On the spectrum of threshold graphs
A New Characterization of P 6-Free Graphs
Characterizing forbidden pairs for relative length of longest paths and cycles
Computing square roots of trivially perfect and threshold graphs
Excluding pairs of graphs
A tree representation for \(P_ 4\)-sparse graphs
On a unique tree representation for \(P_ 4\)-extendible graphs
Partitions of graphs into cographs
Recognizing bull-free perfect graphs
Star coloring of certain graph classes
Partial characterization of graphs having a single large Laplacian eigenvalue
Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
A New Class of Brittle Graphs
Vertex- and edge-minimal and locally minimal graphs
On the complexity of role colouring planar graphs, trees and cographs
Cographs: eigenvalues and Dilworth number
On the relationship between NLC-width and linear NLC-width
A characterization of \(b\)-perfect graphs
The allocation problem in hardware design
Counting Small Induced Subgraphs Satisfying Monotone Properties
The \(A_4\)-structure of a graph
Dominator colorings in some classes of graphs
Colouring of \((P_3 \cup P_2)\)-free graphs
The Erdős-Hajnal conjecture. A survey
Colouring square-free graphs without long induced paths
Dominator and total dominator colorings in graphs
Competitive graph searches
An optimal path cover algorithm for cographs
Functions that are read-once on a subset of their inputs
Forbidden pairs and the existence of a dominating cycle
The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
The price of connectivity for dominating set: upper bounds and complexity
On the \(b\)-dominating coloring of graphs
Partition refinement techniques: an interesting algorithmic tool kit
Lines in hypergraphs
Some perfect coloring properties of graphs
Completely separable graphs
A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
Forbidden subgraphs and the existence of a spanning tree without small degree stems
Partial characterizations of circular-arc graphs
Geometry and Combinatorics via Right-Angled Artin Groups
Complement reducible graphs
Classes of perfect graphs
scientific article; zbMATH DE number 2230325 (Why is no real title available?)
Vizing bound for the chromatic number on some graph classes
Triangle-free graphs and forbidden subgraphs
Processor optimization for flow graphs
Open packing number for some classes of perfect graphs
Forbidden subgraphs for graphs with (near) perfect matching to be Hamiltonian
Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
Transfer flow graphs
On a Class of P ₅ -Free Graphs
Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the \(H_{6}\)-conjecture
The trace monoids in the queue monoid and in the direct product of two free monoids
Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
Spectral properties of cographs and \(P_5\)-free graphs
Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
Cographs and 1-sums
A fast parallel algorithm to recognize P4-sparse graphs
Structure of some \(( P_7, C_4)\)-free graphs with application to colorings
Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
Generalized complementation
Forbidden induced pairs for perfectness and \(\omega\)-colourability of 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)