On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Certifying Algorithm for 3-Colorability of P 5-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four classes of perfectly orderable graphs / 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: Weighted parameters in \((P_5,\overline {P_5})\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on k-Colorability of P 5-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics and Computer Science: Coping with Finiteness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $3$-Colorable $P_5$-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank

Latest revision as of 00:33, 13 July 2024

scientific article
Language Label Description Also known as
English
On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
scientific article

    Statements

    Identifiers