Finding houses and holes in graphs (Q5941278): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3347930 / 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 rigid circuit 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: On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bithreshold Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meyniel weakly triangulated graphs. I: Co-perfect orderability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On brittle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semi-perfect elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Brittle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of recognizing perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank

Latest revision as of 19:23, 3 June 2024

scientific article; zbMATH DE number 1635443
Language Label Description Also known as
English
Finding houses and holes in graphs
scientific article; zbMATH DE number 1635443

    Statements