On the b-coloring of tight graphs (Q512879): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex b-critical trees / 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: Q5419985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(b\)-chromatic number of regular bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393532 / 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: On quasi-monotonous graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture / rank
 
Normal rank

Latest revision as of 11:52, 13 July 2024

scientific article
Language Label Description Also known as
English
On the b-coloring of tight graphs
scientific article

    Statements

    Identifiers