One-three join: a graph operation and its consequences (Q2364085): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in hole- and dart-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algorithms for (\(P_5\), gem)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted efficient domination in two subclasses of \(P_6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in odd-hole-free graphs without dart or without bull / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution and \(\chi\)-boundedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of odd-hole-free graphs by double star cutsets and 2-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Hole Recognition in Graphs of Bounded Clique Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of graph partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the MAX algorithm for maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets for (P_{6}, K_{2,3})-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 04:04, 14 July 2024

scientific article
Language Label Description Also known as
English
One-three join: a graph operation and its consequences
scientific article

    Statements

    One-three join: a graph operation and its consequences (English)
    0 references
    0 references
    0 references
    17 July 2017
    0 references
    one-three join
    0 references
    bipartite-join
    0 references
    homogeneous set
    0 references
    odd hole-free graphs
    0 references

    Identifiers