The following pages link to Douglas Bauer (Q585220):
Displayed 50 items.
- Item:Q585220 (redirect page) (← links)
- Vertex arboricity and vertex degrees (Q343708) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Best monotone degree conditions for binding number and cycle structure (Q496429) (← links)
- Domination alteration sets in graphs (Q585222) (← links)
- Best monotone degree conditions for binding number (Q641165) (← links)
- Long cycles in graphs with large degree sums (Q749553) (← links)
- Hamiltonian degree conditions which imply a graph is pancyclic (Q912127) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- A simple proof of a theorem of Jung (Q918991) (← links)
- A generalization of a result of Häggkvist and Nicoghossian (Q1096650) (← links)
- Graphs isomorphic to subgraphs of their line-graphs (Q1164650) (← links)
- Hamiltonian properties of graphs with large neighborhood unions (Q1182981) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor (Q1684941) (← links)
- Regular \(K_n\)-free graphs (Q1838977) (← links)
- Long cycles in graphs with prescribed toughness and minimum degree (Q1894753) (← links)
- Toughness and triangle-free graphs (Q1907099) (← links)
- A note on dominating cycles in 2-connected graphs (Q1923475) (← links)
- Degree sequences and the existence of \(k\)-factors (Q1926057) (← links)
- Not every 2-tough graph is Hamiltonian (Q1962051) (← links)
- Chordality and 2-factors in tough graphs (Q1962052) (← links)
- Long cycles in 3-cyclable graphs (Q1978141) (← links)
- A generalization of a theorem of Nash-Williams (Q2102754) (← links)
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (Q2370435) (← links)
- Toughness and binding number (Q2448921) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Binding Number, Minimum Degree, and Cycle Structure in Graphs (Q2911065) (← links)
- (Q2971216) (← links)
- Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph (Q3057109) (← links)
- (Q3070257) (← links)
- (Q3139757) (← links)
- (Q3470493) (← links)
- (Q3568730) (← links)
- Tutte sets in graphs I: Maximal tutte sets and D-graphs (Q3594956) (← links)
- (Q3615980) (← links)
- Combinatorial optimization problems in the analysis and design of probabilistic networks (Q3703561) (← links)
- (Q3757937) (← links)
- (Q3816097) (← links)
- (Q3820627) (← links)
- (Q3829577) (← links)
- Graphs with prescribed connectivity and line graph connectivity (Q3855218) (← links)
- The connectivities of line and total graphs (Q3905319) (← links)
- (Q3922713) (← links)
- (Q3924249) (← links)
- (Q3967562) (← links)
- (Q3971997) (← links)
- (Q3976600) (← links)