Journal: Graphs and Combinatorics

Volume 22, Issue 4

433 -- 442Sarmad Abbasi, Asif Jamshed. A Degree Constraint for Uniquely Hamiltonian Graphs
443 -- 452Lech Adamus, A. Pawel Wojda. Almost Symmetric Cycles in Large Digraphs
453 -- 470Lars Døvling Andersen, Preben D. Vestergaard, Zsott Tuza. Largest Non-Unique Subgraphs
471 -- 480S. R. Kingan, Manoel Lemos. On the Circuit-cocircuit Intersection Conjecture
481 -- 485Matthias Kriesell. There Exist Highly Critically Connected Graphs of Diameter Three
487 -- 496Tero Laihonen. Optimal ::::t::::-Edge-Robust ::::r::::-Identifying Codes in the King Lattice
497 -- 502Xueliang Li, Zhao Zhang. A Characterization of Graphs without Even Factors
503 -- 513Xuechao Li. Sizes of Critical Graphs with Small Maximum Degrees
515 -- 525Liqun Pu, Hung-Lin Fu, Hao Shen. -Decompositions of and ::::D::::::::::v:::::: UNION ::::P:::: where ::::P:::: is a 2-Regular Subgraph of ::::D::::::::::v::::::
527 -- 543Csaba D. Tóth. Alternating Paths along Axis-Parallel Segments
545 -- 571Haiyan Wang, Yanxun Chang. Kite-group Divisible Designs of Type ::::g:::::::::::t:::::::::::u:::::::1:::