Vizing bound for the chromatic number on some graph classes
From MaRDI portal
Publication:2631086
Recommendations
Cites work
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1455118 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- 3-colorability and forbidden subgraphs. I: Characterizing pairs
- A Linear Recognition Algorithm for Cographs
- A structure theorem for graphs with no cycle with a unique chord and its consequences
- Algorithmic graph theory and perfect graphs
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
- CHROMATIC BOUNDS FOR A CLASS OF GRAPHS
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- Forbidden subgraphs and 3-colorings
- Graph Classes: A Survey
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
- Independent set in \(P_5\)-free graphs in polynomial time
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- Linear recognition of pseudo-split graphs
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- On a property of the class of n-colorable graphs
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- On the chromatic index of multigraphs without large triangles
- Perfect coloring and linearly χ-boundP6-free graphs
- Radius two trees specify χ‐bounded classes
- Some applications of Vizing's theorem to vertex colorings of graphs
- Sur le coloriage des graphs
- The strong perfect graph theorem
- Vertex colouring and forbidden subgraphs -- a survey
- Weighted independent sets in classes of \(P_6\)-free graphs
Cited in
(21)- Chromatic bounds for the subclasses of pK₂-free graphs
- Forbidden subgraphs and 3-colorings
- Colouring of (P₃ P₂)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor
- Chromatic bounds for some classes of 2 K₂-free graphs
- On the chromatic number of (\(P_6\), diamond)-free graphs
- Coloring of \((P_6, \mathrm{dart}, K_4)\)-free graphs
- Colouring graphs with no induced six-vertex path or diamond
- Colouring graphs with no induced six-vertex path or diamond
- -boundedness and related problems on graphs without long induced paths: a survey
- THE CHROMATIC NUMBER OF -FREE GRAPHS
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
- Linear χ -binding functions for some classes of ( P 3 ∪ P 2 )-free graphs
- Bounds for the chromatic number of some \(pK_2\)-free graphs
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
- On graphs with no induced five‐vertex path or paraglider
- Locating-dominating sets: from graphs to oriented graphs
- On the chromatic number of (P5,dart)-free graphs
- Chromatic number versus chromatic number in graphs with bounded clique number
This page was built for publication: Vizing bound for the chromatic number on some graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631086)
