Characterization of \(P_{6}\)-free graphs (Q881583): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A characterization of graphs without long induced paths / 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: Domination properties and induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of two non-neighboring subgraphs in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to ``Topics on Domination'' / 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: On a property of the class of n-colorable graphs / rank
 
Normal rank

Revision as of 19:20, 25 June 2024

scientific article
Language Label Description Also known as
English
Characterization of \(P_{6}\)-free graphs
scientific article

    Statements

    Identifiers