A new characterization of \(P_k\)-free graphs (Q300476): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-9989-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095269023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three complexity results on coloring \(P_k\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of connectivity for dominating set: upper bounds and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Improved Complexity Results on k-Coloring P t -Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of \(P_{6}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating subgraphs in graphs with some forbidden structures / 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: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Characterization of P 6-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of \(P_{6}\)-free graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:31, 12 July 2024

scientific article
Language Label Description Also known as
English
A new characterization of \(P_k\)-free graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references