Vizing bound for the chromatic number on some graph classes (Q2631086): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-015-1651-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2284570459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHROMATIC BOUNDS FOR A CLASS OF GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect coloring and linearly χ-boundP6-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Subgraphs and 3-Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity results on \(k\)-coloring \(P_t\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted independent sets in classes of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic index of multigraphs without large triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of Vizing's theorem to vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear recognition of pseudo-split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability and forbidden subgraphs. I: Characterizing pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for graphs with no cycle with a unique chord and its consequences / rank
 
Normal rank

Latest revision as of 09:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Vizing bound for the chromatic number on some graph classes
scientific article

    Statements

    Vizing bound for the chromatic number on some graph classes (English)
    0 references
    0 references
    0 references
    28 July 2016
    0 references
    0 references
    chromatic number
    0 references
    \(\chi\)-bounded class
    0 references
    \(P_6\)-free
    0 references
    diamond-free graph
    0 references
    0 references
    0 references
    0 references
    0 references