| 1 | Exploring Hamilton-connectedness in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e334" altimg="si10.svg"><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>Γ</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>18</mml | 0.9 | 0 | Citations (PDF) |
| 2 | Graphs with Supereulerian Width 3 and Small Diameters | 0.9 | 0 | Citations (PDF) |
| 3 | The matching-connectivity of a graph | 0.9 | 2 | Citations (PDF) |
| 4 | Spanning trails avoiding and containing given edges | 1.1 | 0 | Citations (PDF) |
| 5 | Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs | 0.7 | 0 | Citations (PDF) |
| 6 | On r-hued coloring of connected P5-free tripartite graphs | 1.8 | 0 | Citations (PDF) |
| 7 | Squares of graphs are optimally <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e20" altimg="si25.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-supereulerian | 0.9 | 0 | Citations (PDF) |
| 8 | Supereulerian regular matroids without small cocircuits | 0.8 | 2 | Citations (PDF) |
| 9 | Complete family reduction and spanning connectivity in line graphs | 0.7 | 1 | Citations (PDF) |
| 10 | On list r-hued coloring of outer-1-planar graphs | 1.8 | 0 | Citations (PDF) |
| 11 | Hamilton-connected claw-free graphs with Ore-degree conditions | 0.9 | 1 | Citations (PDF) |
| 12 | Fractional matching number and spectral radius of nonnegative matrices of graphs | 1.2 | 4 | Citations (PDF) |
| 13 | On
r
-hued list coloring of
K
4
(
7
)
| 0.9 | 6 | Citations (PDF) |
| 14 | On the extended Clark-Wormold Hamiltonian-like index problem | 0.7 | 1 | Citations (PDF) |
| 15 | Hamiltonian s-properties and eigenvalues of k-connected graphs | 0.7 | 6 | Citations (PDF) |
| 16 | On hamiltonian line graphs of hypergraphs | 0.8 | 2 | Citations (PDF) |
| 17 | A Condition on Hamilton-Connected Line Graphs | 0.9 | 2 | Citations (PDF) |
| 18 | Hamiltonian line graphs with local degree conditions | 0.7 | 1 | Citations (PDF) |
| 19 | Local Optimality of Mixed Reliability for Several Classes of Networks with Fixed Sizes | 1.4 | 2 | Citations (PDF) |
| 20 | The Extremal Sizes of Arc-Maximal (k, l)-Digraphs | 0.5 | 1 | Citations (PDF) |
| 21 | Hamiltonian index of directed multigraph | 1.8 | 1 | Citations (PDF) |
| 22 | Modulo orientations and matchings in graphs | 0.7 | 0 | Citations (PDF) |
| 23 | On the s-hamiltonianicity of an hourglass-free line graph | 0.7 | 1 | Citations (PDF) |
| 24 | Strengthened Ore conditions for (s,t)-supereulerian graphs | 0.9 | 1 | Citations (PDF) |
| 25 | On the Sizes of k-edge-maximal r-uniform Hypergraphs | 0.7 | 3 | Citations (PDF) |
| 26 | Graph r-hued colorings—A survey | 0.9 | 19 | Citations (PDF) |
| 27 | Bounding ℓ-edge-connectivity in edge-connectivity | 0.9 | 1 | Citations (PDF) |
| 28 | On the line graph of a graph with diameter 2 | 0.7 | 1 | Citations (PDF) |
| 29 | On (s,t)-supereulerian graphs with linear degree bounds | 0.7 | 2 | Citations (PDF) |
| 30 | Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number | 0.9 | 2 | Citations (PDF) |
| 31 | On s-hamiltonicity of net-free line graphs | 0.7 | 0 | Citations (PDF) |
| 32 | Polynomially determining spanning connectivity of locally connected line graphs | 0.9 | 1 | Citations (PDF) |
| 33 | Group Colorings and DP-Colorings of Multigraphs Using Edge-Disjoint Decompositions | 0.5 | 2 | Citations (PDF) |
| 34 | Induced subgraphs of product graphs and a generalization of Huang's theorem | 0.8 | 5 | Citations (PDF) |
| 35 | Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube | 1.8 | 3 | Citations (PDF) |
| 36 | Symmetric core and spanning trails in directed networks | 0.7 | 1 | Citations (PDF) |
| 37 | Matching and spanning trails in digraphs | 0.9 | 1 | Citations (PDF) |
| 38 | Polynomially determine if a graph is (s,3)-supereulerian | 0.7 | 2 | Citations (PDF) |
| 39 | Multigraphic Degree Sequences and Hamiltonian-connected Line Graphs | 0.7 | 0 | Citations (PDF) |
| 40 | A Note on Group Colorings and Group Structure | 0.7 | 2 | Citations (PDF) |
| 41 | On the extremal sizes of maximal graphs without (k+1)-connected subgraphs | 0.9 | 5 | Citations (PDF) |
| 42 | Contractible graphs for flow index less than three | 0.7 | 1 | Citations (PDF) |
| 43 | Catlin’s reduced graphs with small orders | 0.6 | 2 | Citations (PDF) |
| 44 | Connectivity and eigenvalues of graphs with given girth or clique number | 0.9 | 6 | Citations (PDF) |
| 45 | Decomposition and r-hued Coloring of K4(7)-minor free graphs | 1.8 | 3 | Citations (PDF) |
| 46 | On weighted modulo orientation of graphs | 0.8 | 0 | Citations (PDF) |
| 47 | Chvátal–Erdős Conditions and Almost Spanning Trails | 0.9 | 3 | Citations (PDF) |
| 48 | A characterization of graphs with supereulerian line graphs | 0.4 | 3 | Citations (PDF) |
| 49 | Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs | 0.5 | 2 | Citations (PDF) |
| 50 | On the sizes of bi-k-maximal graphs | 0.9 | 3 | Citations (PDF) |
| 51 | Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs | 0.5 | 10 | Citations (PDF) |
| 52 | Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree | 0.5 | 3 | Citations (PDF) |
| 53 | Characterizations of matroids with an element lying in a restricted number of circuits | 0.9 | 0 | Citations (PDF) |
| 54 | On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs | 0.5 | 5 | Citations (PDF) |
| 55 | On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e104" altimg="si28.svg"><mml:mi>s</mml:mi></mml:math>-hamiltonian line graphs of claw-free graphs | 0.7 | 4 | Citations (PDF) |
| 56 | Vertex-connectivity and eigenvalues of graphs | 0.9 | 8 | Citations (PDF) |
| 57 | Spanning tree packing number and eigenvalues of graphs with given girth | 0.9 | 14 | Citations (PDF) |
| 58 | On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e38" altimg="si28.gif"><mml:mi>r</mml:mi></mml:math>-hued colorings of graphs without short induced paths | 0.7 | 4 | Citations (PDF) |
| 59 | Spectral results on Hamiltonian problem | 0.7 | 16 | Citations (PDF) |
| 60 | Bounds for the matching number and cyclomatic number of a signed graph in terms of rank | 0.9 | 19 | Citations (PDF) |
| 61 | Modulo 5-orientations and degree sequences | 0.9 | 0 | Citations (PDF) |
| 62 | Collapsible subgraphs of a 4-edge-connected graph | 0.9 | 2 | Citations (PDF) |
| 63 | Spectral analogues of Erdős’ theorem on Hamilton-connected graphs | 1.8 | 7 | Citations (PDF) |
| 64 | Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs | 0.7 | 15 | Citations (PDF) |
| 65 | Vertex-connectivity and eigenvalues of graphs with fixed girth | 1.8 | 6 | Citations (PDF) |
| 66 | Packing spanning trees in highly essentially connected graphs | 0.7 | 7 | Citations (PDF) |
| 67 | Upper bounds of r-hued colorings of planar graphs | 0.9 | 17 | Citations (PDF) |
| 68 | Supereulerian bipartite digraphs | 0.8 | 9 | Citations (PDF) |
| 69 | An $O({\log}_2(N))$ Algorithm for Reliability Evaluation of $h$-Extra Edge-Connectivity of Folded Hypercubes | 3.7 | 44 | Citations (PDF) |
| 70 | Minimax properties of some density measures in graphs and digraphs | 0.4 | 4 | Citations (PDF) |
| 71 | r-hued coloring of sparse graphs | 0.9 | 8 | Citations (PDF) |
| 72 | Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs | 0.7 | 0 | Citations (PDF) |
| 73 | On the permanental sum of graphs | 1.8 | 15 | Citations (PDF) |
| 74 | Degree sum and hamiltonian-connected line graphs | 0.7 | 8 | Citations (PDF) |
| 75 | On the permanental nullity and matching number of graphs | 1.2 | 17 | Citations (PDF) |
| 76 | A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs | 0.7 | 0 | Citations (PDF) |
| 77 | Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees | 0.8 | 9 | Citations (PDF) |
| 78 | Connectivity keeping stars or double-stars in 2-connected graphs | 0.7 | 16 | Citations (PDF) |
| 79 | Sensitivity of r-hued colouring of graphs | 0.4 | 0 | Citations (PDF) |
| 80 | Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral | 0.5 | 2 | Citations (PDF) |
| 81 | Modulo orientations with bounded independence number | 0.9 | 1 | Citations (PDF) |
| 82 | List r-hued chromatic number of graphs with bounded maximum average degrees | 0.7 | 3 | Citations (PDF) |
| 83 | Locally dense supereulerian digraphs | 0.9 | 5 | Citations (PDF) |
| 84 | Pancyclicity of 4-Connected
$$\{K_{1,3},Z_8\}$$
{
K
1
,
3
,
Z
8
| 0.5 | 0 | Citations (PDF) |
| 85 | Onk-Maximal Strength Digraphs | 0.8 | 10 | Citations (PDF) |
| 86 | Characterization of Digraphic Sequences with Strongly Connected Realizations | 0.8 | 3 | Citations (PDF) |
| 87 | 3-dynamic coloring and list 3-dynamic coloring of K1,3-free graphs | 0.9 | 12 | Citations (PDF) |
| 88 | Panconnected index of graphs | 0.7 | 4 | Citations (PDF) |
| 89 | Supereulerian width of dense graphs | 0.7 | 2 | Citations (PDF) |
| 90 | Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees | 0.7 | 11 | Citations (PDF) |
| 91 | The (signless) Laplacian spectral radii ofc-cyclic graphs withnvertices, girthgandkpendant vertices | 1.2 | 3 | Citations (PDF) |
| 92 | Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs | 1.1 | 9 | Citations (PDF) |
| 93 | Spanning trails with variations of Chvátal–Erdős conditions | 0.7 | 5 | Citations (PDF) |
| 94 | The index problem of group connectivity | 0.0 | 0 | Citations (PDF) |
| 95 | On the lower bound of k-maximal digraphs | 0.7 | 9 | Citations (PDF) |
| 96 | Algorithms for the partial inverse matroid problem in which weights can only be increased | 1.2 | 15 | Citations (PDF) |
| 97 | Fractional spanning tree packing, forest covering and eigenvalues | 0.9 | 10 | Citations (PDF) |
| 98 | Ore-type degree condition of supereulerian digraphs | 0.7 | 12 | Citations (PDF) |
| 99 | Element deletion changes in dynamic coloring of graphs | 0.7 | 4 | Citations (PDF) |
| 100 | Supereulerian Digraphs with Large Arc‐Strong Connectivity | 0.8 | 17 | Citations (PDF) |
| 101 | Algorithm for constraint partial inverse matroid problem with weight increase forbidden | 0.7 | 17 | Citations (PDF) |
| 102 | On Perfect Matching Coverings and Even Subgraph Coverings | 0.8 | 12 | Citations (PDF) |
| 103 | Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs | 0.8 | 31 | Citations (PDF) |
| 104 | On dense strongly Z2s+1-connected graphs | 0.7 | 0 | Citations (PDF) |
| 105 | Supereulerian digraphs with given local structures | 0.4 | 11 | Citations (PDF) |
| 106 | Supereulerian graphs with width s and s-collapsible graphs | 0.9 | 8 | Citations (PDF) |
| 107 | Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs | 0.9 | 4 | Citations (PDF) |
| 108 | On r-hued coloring of planar graphs with girth at least 6 | 0.9 | 24 | Citations (PDF) |
| 109 | Characterizations of k-cutwidth critical trees | 0.9 | 5 | Citations (PDF) |
| 110 | On a Class of Supereulerian Digraphs | 0.4 | 10 | Citations (PDF) |
| 111 | Two operations on a graph preserving the (non)existence of 2-factors in its line graph | 0.3 | 0 | Citations (PDF) |
| 112 | Graphs with a 3-Cycle-2-Cover | 0.5 | 0 | Citations (PDF) |
| 113 | Per-spectral characterizations of some edge-deleted subgraphs of a complete graph | 1.2 | 19 | Citations (PDF) |
| 114 | Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations | 0.5 | 2 | Citations (PDF) |
| 115 | Supereulerian graphs and the Petersen graph | 0.6 | 4 | Citations (PDF) |
| 116 | Realizing degree sequences as Z3-connected graphs | 0.7 | 4 | Citations (PDF) |
| 117 | Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs | 1.4 | 10 | Citations (PDF) |
| 118 | On Mod $(2s+1)$-Orientations of Graphs | 0.7 | 2 | Citations (PDF) |
| 119 | Note on edge-disjoint spanning trees and eigenvalues | 0.9 | 28 | Citations (PDF) |
| 120 | Edge-disjoint spanning trees and eigenvalues | 0.9 | 18 | Citations (PDF) |
| 121 | On stronglyZ2s+1-connected graphs | 0.9 | 13 | Citations (PDF) |
| 122 | Onr-hued coloring ofK4-minor free graphs | 0.7 | 25 | Citations (PDF) |
| 123 | On extremalk-supereulerian graphs | 0.7 | 1 | Citations (PDF) |
| 124 | Spanning trails in essentially 4-edge-connected graphs | 0.9 | 6 | Citations (PDF) |
| 125 | Supereulerian digraphs | 0.7 | 19 | Citations (PDF) |
| 126 | Augmenting and preserving partition connectivity of a hypergraph | 0.0 | 2 | Citations (PDF) |
| 127 | On s‐Hamiltonian Line Graphs | 0.8 | 8 | Citations (PDF) |
| 128 | Hamilton cycles in 3-connected claw-free and net-free graphs | 0.7 | 7 | Citations (PDF) |
| 129 | Group colorability of multigraphs | 0.7 | 4 | Citations (PDF) |
| 130 | Note on the spectral characterization of some cubic graphs with maximum number of triangles | 0.9 | 2 | Citations (PDF) |
| 131 | Collapsible Graphs and Hamiltonicity of Line Graphs | 0.5 | 2 | Citations (PDF) |
| 132 | Characterizations of Strength Extremal Graphs | 0.5 | 5 | Citations (PDF) |
| 133 | Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees | 2.5 | 5 | Citations (PDF) |
| 134 | Characterization of removable elements with respect to having k disjoint bases in a matroid | 0.9 | 11 | Citations (PDF) |
| 135 | Spanning cycles in regular matroids without small cocircuits | 0.8 | 3 | Citations (PDF) |
| 136 | On dynamic coloring for planar graphs and graphs of higher genus | 0.9 | 40 | Citations (PDF) |
| 137 | Spanning subgraph with Eulerian components | 0.7 | 2 | Citations (PDF) |
| 138 | Degree condition and Z3-connectivity | 0.7 | 13 | Citations (PDF) |
| 139 | On 3-connected hamiltonian line graphs | 0.7 | 0 | Citations (PDF) |
| 140 | A dual version of the Brooks group coloring theorem | 0.7 | 0 | Citations (PDF) |
| 141 | Z3-connectivity of 4-edge-connected 2-triangular graphs | 0.8 | 1 | Citations (PDF) |
| 142 | Group connectivity of complementary graphs | 0.8 | 4 | Citations (PDF) |
| 143 | On Spanning Disjoint Paths in Line Graphs | 0.5 | 8 | Citations (PDF) |
| 144 | Spanning 3-connected index of graphs | 0.9 | 5 | Citations (PDF) |
| 145 | Characterization of minimally -connected graphs | 0.4 | 2 | Citations (PDF) |
| 146 | Group connectivity in line graphs | 0.7 | 3 | Citations (PDF) |
| 147 | Supereulerian graphs and matchings | 2.5 | 9 | Citations (PDF) |
| 148 | Supereulerian graphs in the graph family C2(6,k) | 0.9 | 6 | Citations (PDF) |
| 149 | Degree sequences and graphs with disjoint spanning trees | 0.9 | 6 | Citations (PDF) |
| 150 | The Connectivity and Diameter of Second Order Circuit Graphs of Matroids | 0.5 | 2 | Citations (PDF) |
| 151 | Balanced and 1-balanced graph constructions | 0.9 | 5 | Citations (PDF) |
| 152 | On (s,t)-supereulerian graphs in locally highly connected graphs | 0.7 | 7 | Citations (PDF) |
| 153 | Degree conditions for group connectivity | 0.7 | 20 | Citations (PDF) |
| 154 | Every 3‐connected claw‐free
Z
8
‐free graph is Hamiltonian | 0.8 | 17 | Citations (PDF) |
| 155 | The Chvátal–Erdös condition for supereulerian graphs and the Hamiltonian index | 0.7 | 19 | Citations (PDF) |
| 156 | On 3-edge-connected supereulerian graphs in graph family
C
(
l
,
k
)
| 0.7 | 2 | Citations (PDF) |
| 157 | Degree sum condition for Z3-connectivity in graphs | 0.7 | 22 | Citations (PDF) |
| 158 | Group connectivity and group colorings of graphs — A survey | 0.6 | 32 | Citations (PDF) |
| 159 | On 3-Edge-Connected Supereulerian Graphs | 0.5 | 1 | Citations (PDF) |
| 160 | Reinforcing a Matroid to Have k Disjoint Bases | 0.4 | 7 | Citations (PDF) |
| 161 | Multi-gbase index of primitive anti-symmetric sign pattern matrices | 1.2 | 5 | Citations (PDF) |
| 162 | Hamilton-connected indices of graphs | 0.7 | 9 | Citations (PDF) |
| 163 | Random walks for selected boolean implication and equivalence problems | 0.3 | 0 | Citations (PDF) |
| 164 | On mod | 1.1 | 12 | Citations (PDF) |
| 165 | Hamiltonian connectedness in 3-connected line graphs | 0.9 | 24 | Citations (PDF) |
| 166 | Transforming a graph into a 1-balanced graph | 0.9 | 6 | Citations (PDF) |
| 167 | Edge-connectivity and edge-disjoint spanning trees | 0.7 | 31 | Citations (PDF) |
| 168 | The supereulerian graphs in the graph family C(l,k) | 0.7 | 8 | Citations (PDF) |
| 169 | Every line graph of a 4-edge-connected graph is Z3-connected | 0.8 | 5 | Citations (PDF) |
| 170 | On Group Connectivity of Graphs | 0.5 | 11 | Citations (PDF) |
| 171 | On s-hamiltonian-connected line graphs | 0.7 | 8 | Citations (PDF) |
| 172 | The | 0.7 | 10 | Citations (PDF) |
| 173 | Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected | 0.7 | 10 | Citations (PDF) |
| 174 | Degree sequence and supereulerian graphs | 0.7 | 5 | Citations (PDF) |
| 175 | Spanning cycles in regular matroids without | 0.8 | 2 | Citations (PDF) |
| 176 | Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions | 0.7 | 23 | Citations (PDF) |
| 177 | An s-Hamiltonian Line Graph Problem | 0.5 | 5 | Citations (PDF) |
| 178 | An inequality for the group chromatic number of a graph | 0.7 | 5 | Citations (PDF) |
| 179 | Conditional colorings of graphs | 0.7 | 58 | Citations (PDF) |
| 180 | Group connectivity of graphs with diameter at most 2 | 0.8 | 16 | Citations (PDF) |
| 181 | Hamiltonicity in 3-connected claw-free graphs | 1.1 | 13 | Citations (PDF) |
| 182 | Every 3-connected, essentially 11-connected line graph is Hamiltonian | 1.1 | 16 | Citations (PDF) |
| 183 | Group chromatic number of planar graphs of girth at least 4 | 0.8 | 12 | Citations (PDF) |
| 184 | Eulerian subgraphs and Hamilton-connected line graphs | 0.9 | 51 | Citations (PDF) |
| 185 | HamiltonianN2-locally connected claw-free graphs | 0.8 | 7 | Citations (PDF) |
| 186 | Nowhere zero 4-flow in regular matroids | 0.8 | 2 | Citations (PDF) |
| 187 | Spanning Trails Connecting Given Edges | 0.5 | 4 | Citations (PDF) |
| 188 | On Group Chromatic Number of Graphs | 0.5 | 7 | Citations (PDF) |
| 189 | Nowhere-zero 3-flows in locally connected graphs | 0.8 | 37 | Citations (PDF) |
| 190 | Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs | 0.8 | 19 | Citations (PDF) |
| 191 | Minimally (k, k)-edge-connected graphs | 0.8 | 5 | Citations (PDF) |
| 192 | Small cycle cover of 2-connected cubic graphs | 0.7 | 5 | Citations (PDF) |
| 193 | Group Chromatic Number of Graphs without K 5 -Minors | 0.5 | 21 | Citations (PDF) |
| 194 | Hamilton weights and Petersen minors | 0.8 | 6 | Citations (PDF) |
| 195 | Nowhere zero flows in line graphs | 0.7 | 6 | Citations (PDF) |
| 196 | Eulerian subgraphs containing given edges | 0.7 | 9 | Citations (PDF) |
| 197 | Graph family operations | 0.7 | 15 | Citations (PDF) |
| 198 | Group Connectivity of 3-Edge-Connected Chordal Graphs | 0.5 | 66 | Citations (PDF) |
| 199 | Extending a partial nowhere-zero 4-flow | 0.8 | 13 | Citations (PDF) |
| 200 | A Property on Edge-disjoint Spanning Trees | 0.8 | 3 | Citations (PDF) |
| 201 | Supereulerian Graphs and the Petersen Graph | 1.1 | 13 | Citations (PDF) |
| 202 | Graphs without spanning closed trails | 0.7 | 85 | Citations (PDF) |
| 203 | Edge-maximal (k, i)-graphs | 0.8 | 4 | Citations (PDF) |
| 204 | Supereulerian complementary graphs | 0.8 | 3 | Citations (PDF) |
| 205 | Collapsible graphs and matchings | 0.8 | 16 | Citations (PDF) |
| 206 | Fractional arboricity, strength, and principal partitions in graphs and matroids | 0.9 | 56 | Citations (PDF) |
| 207 | Duality in graph families | 0.7 | 10 | Citations (PDF) |
| 208 | Nowhere-zero 3-flows of highly connected graphs | 0.7 | 22 | Citations (PDF) |
| 209 | Reduced graphs of diameter two | 0.8 | 12 | Citations (PDF) |
| 210 | The size of strength-maximal graphs | 0.8 | 13 | Citations (PDF) |
| 211 | Contractions and hamiltonian line graphs | 0.8 | 22 | Citations (PDF) |
| 212 | On the Hamiltonian index | 0.7 | 27 | Citations (PDF) |
| 213 | Spectral and extremal conditions for supereulerian graphs | 1.2 | 0 | Citations (PDF) |
| 214 | Supereulerian Oriented Graphs With Large Arc‐Strong Connectivity | 0.8 | 0 | Citations (PDF) |
| 215 | Spanning Eulerian Subdigraph in Line Digraphs | 1.0 | 0 | Citations (PDF) |
| 216 | Spectral conditions for the maximum subgraph edge-connectivity of graphs | 0.9 | 0 | Citations (PDF) |
