The following pages link to (Q4401977):
Displayed 24 items.
- Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs (Q297939) (← links)
- A maximum degree theorem for diameter-2-critical graphs (Q403217) (← links)
- A characterization of diameter-2-critical graphs with no antihole of length four (Q424139) (← links)
- A characterization of diameter-2-critical graphs whose complements are diamond-free (Q442211) (← links)
- Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs (Q442306) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey (Q498431) (← links)
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free (Q666001) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- On Ringeisen's isolation game. II (Q804481) (← links)
- Regular separable graphs of minimum order with given diameter (Q1148920) (← links)
- Balanced graphs and noncovering graphs (Q1176731) (← links)
- Graphs with small diameter after edge deletion (Q1199416) (← links)
- The isolation game for regular graphs (Q1210561) (← links)
- Maximum genus and girth of graphs (Q1297489) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Cycles in Hamiltonian graphs of prescribed maximum degree (Q1810655) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- A note on pancyclism of highly connected graphs (Q1883250) (← links)
- On the structure of the set of cycle lengths in a Hamiltonian graph (Q1883261) (← links)
- On a conjecture of Murty and Simon on diameter 2-critical graphs (Q2275449) (← links)
- A characterization of \(P_5\)-free, diameter-2-critical graphs (Q2449064) (← links)
- All My Favorite Conjectures Are Critical (Q5506776) (← links)