The following pages link to The treewidth of line graphs (Q723884):
Displaying 11 items.
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- The treewidth of 2-section of hypergraphs (Q5024663) (← links)
- (Q5089157) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
- Treewidth of the \(q\)-Kneser graphs (Q6184322) (← links)
- Properties of uniformly \(3\)-connected graphs (Q6599816) (← links)
