The following pages link to Topology of Thin Film RC Circuits (Q5521330):
Displayed 12 items.
- A problem of Berge (Q787173) (← links)
- Graphs without \(K_ 4\) and well-quasi-ordering (Q1058531) (← links)
- Irrepresentability by multiple intersection, or why the interval number is unbounded (Q1065021) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- String graphs requiring exponential representations (Q1121918) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Crossing Number is NP-Complete (Q3320398) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)