Pages that link to "Item:Q1923778"
From MaRDI portal
The following pages link to Extensions and consequences of Chvátal-Erdös' theorem (Q1923778):
Displaying 9 items.
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index (Q982614) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- An extension of the Win theorem: counting the number of maximum independent sets (Q2002161) (← links)
- A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs (Q2124605) (← links)
- An extension of the Chvátal-Erdős theorem: counting the number of maximum independent sets (Q2354602) (← links)
- Chvátal-Erdös type theorems (Q3059093) (← links)
- Non-erasing Variants of the Chomsky–Schützenberger Theorem (Q3167489) (← links)
- A chvátal–erdős type condition for hamiltonian graphs (Q4317221) (← links)
- Generalized degree conditions for graphs with bounded independence number (Q4698089) (← links)