scientific article; zbMATH DE number 3435527
From MaRDI portal
Publication:4401977
Cited in
(24)- Cycles in Hamiltonian graphs of prescribed maximum degree
- On the structure of the set of cycle lengths in a Hamiltonian graph
- A maximum degree theorem for diameter-2-critical graphs
- Efficient sets in partial k-trees
- A characterization of diameter-2-critical graphs with no antihole of length four
- All my favorite conjectures are critical
- On minimizing the largest eigenvalue of a symmetric matrix
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- A characterization of \(P_5\)-free, diameter-2-critical graphs
- Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
- Nowhere-zero 3-flows and Z₃-connectivity of graphs without two forbidden subgraphs
- A characterization of diameter-2-critical graphs whose complements are diamond-free
- A note on pancyclism of highly connected graphs
- Regular separable graphs of minimum order with given diameter
- The isolation game for regular graphs
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- Matchings and covers in hypergraphs
- Intersecting designs from linear programming and graphs of diameter two
- Graphs with small diameter after edge deletion
- Balanced graphs and noncovering graphs
- Total domination edge critical graphs with total domination number three and many dominating pairs
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- Maximum genus and girth of graphs
- On Ringeisen's isolation game. II
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401977)
