A Degree Constraint for Uniquely Hamiltonian Graphs Sarmad AbbasiAsif Jamshed OriginalPaper Pages: 433 - 442
Largest Non-Unique Subgraphs Lars Døvling AndersenPreben Dahl VestergaardZsott Tuza OriginalPaper Pages: 453 - 470
On the Circuit-cocircuit Intersection Conjecture S. R. KinganManoel Lemos OriginalPaper Pages: 471 - 480
There Exist Highly Critically Connected Graphs of Diameter Three Matthias Kriesell OriginalPaper Pages: 481 - 485
Optimal t-Edge-Robust r-Identifying Codes in the King Lattice Tero Laihonen OriginalPaper Pages: 487 - 496
A Characterization of Graphs without Even Factors Xueliang LiZhao Zhang OriginalPaper Pages: 497 - 502
-Decompositions of and D v ∪P where P is a 2-Regular Subgraph of D v Liqun PuHung-Lin FuHao Shen OriginalPaper Pages: 515 - 525