Pages that link to "Item:Q4101862"

The following pages link to Split Graphs Having Dilworth Number Two (Q4101862):

Displaying 2 items.

• A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs (Q505460) (← links)
• Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)