\(b\)-coloring of tight graphs (Q1759847): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient algorithms for graphs with few \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the b-coloring of cographs and \(P_{4}\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(b\)-coloring of \(P_{4}\)-tidy graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_{4}\)-laden graphs: A new class of brittle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The b-chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a unique tree representation for \(P_ 4\)-extendible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the b-chromatic number of some families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank

Latest revision as of 22:39, 5 July 2024

scientific article
Language Label Description Also known as
English
\(b\)-coloring of tight graphs
scientific article

    Statements

    \(b\)-coloring of tight graphs (English)
    0 references
    0 references
    0 references
    22 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    \(b\)-coloring
    0 references
    precoloring extension
    0 references
    tight graphs
    0 references
    0 references