On s-Hamiltonian-Connected Line Graphs

[1] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Elsevier Science Publishing Co. Inc. New York NY, 1976). https://doi.org/10.1007/978-1-349-03521-210.1007/978-1-349-03521-2 Search in Google Scholar

[2] P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29–44. https://doi.org/10.1002/jgt.319012010510.1002/jgt.3190120105 Search in Google Scholar

[3] P.A. Catlin, Z. Han and H.-J. Lai, Graphs without spanning closed trails, Discrete Math. 160 (1996) 81–91. https://doi.org/10.1016/S0012-365X(95)00149-Q10.1016/S0012-365X(95)00149-Q Search in Google Scholar

[4] P.A. Catlin, H.-J. Lai and Y. Shao, Edge-connectivity and edge-disjoint spanning trees, Discrete Math. 309 (2009) 1033–1040. https://doi.org/10.1016/j.disc.2007.11.05610.1016/j.disc.2007.11.056 Search in Google Scholar

[5] Z.-H. Chen, H.-J. Lai, W. Shiu and D.Y. Li, An s-hamiltonian line graph problem, Graphs Combin. 23 (2007) 241–248. https://doi.org/10.1007/s00373-007-0727-y10.1007/s00373-007-0727-y Search in Google Scholar

[6] F. Harary and C.St.J.A. Nash-Williams, On eulerian and hamiltonian graphs and line graphs, Canad. Math. Bull. 8 (1965) 701–710. https://doi.org/10.4153/CMB-1965-051-310.4153/CMB-1965-051-3 Search in Google Scholar

[7] F. Jaeger, A note on sub-Eulerian graphs, J. Graph Theory 3 (1979) 91–93. https://doi.org/10.1002/jgt.319003011010.1002/jgt.3190030110 Search in Google Scholar

[8] T. Kaiser, Z. Ryjáček and P. Vrána, On 1-Hamilton-connected claw-free graphs, Discrete Math. 321 (2014) 1–11. https://doi.org/10.1016/j.disc.2013.12.00910.1016/j.disc.2013.12.009 Search in Google Scholar

[9] T. Kaiser and P. Vrána, Hamilton cycles in 5-connected line graphs, European J. Combin. 33 (2012) 924–947. https://doi.org/10.1016/j.ejc.2011.09.01510.1016/j.ejc.2011.09.015 Search in Google Scholar

[10] M. Kriesell, Every 4-connected line graph of claw-free graphs are hamiltonian-connected, J. Combin. Theory Ser. B 82 (2001) 306–315. https://doi.org/10.1006/jctb.2001.204010.1006/jctb.2001.2040 Search in Google Scholar

[11] R. Kužel and L. Xiong, Every 4-connected line graph is hamiltonian if and only if it is hamiltonian-connected, in: R. Kučzel: Hamiltonian Properties of Graphs, Ph.D. Thesis, (U.W.B. Pilsen, 2004). Search in Google Scholar

[12] H.-J. Lai, Y. Liang and Y. Shao, On s-hamiltonian-connected line graphs, Discrete Math. 308 (2008) 4293–4297. https://doi.org/10.1016/j.disc.2007.07.12010.1016/j.disc.2007.07.120 Search in Google Scholar

[13] H.-J. Lai and Y. Shao, On s-hamiltonian line graphs, J. Graph Theory 74 (2013) 344–358. https://doi.org/10.1002/jgt.2171310.1002/jgt.21713 Search in Google Scholar

[14] H.-J. Lai, Y. Shao, G. Yu and M. Zhan, Hamiltonian connectedness in 3-connected line graphs, Discrete Appl. Math. 157 (2009) 982–990. https://doi.org/10.1016/j.dam.2008.02.00510.1016/j.dam.2008.02.005 Search in Google Scholar

[15] H.-J. Lai, M. Zhan, T. Zhang and J. Zhou, On s-hamiltonian line graphs of claw-free graphs, Discrete Math. 342 (2019) 3006–3016. https://doi.org/10.1016/j.disc.2019.06.00610.1016/j.disc.2019.06.006 Search in Google Scholar

[16] M.M. Matthews and D.P. Sumner, Hamiltonian results in K_1,3-free graphs, J. Graph Theory 8 (1984) 139–146. https://doi.org/10.1002/jgt.319008011610.1002/jgt.3190080116 Search in Google Scholar

[17] Z. Ryjáček and P. Vrána, Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs, J. Graph Theory 66 (2011) 152–173. https://doi.org/10.1002/jgt.2049810.1002/jgt.20498 Search in Google Scholar

[18] Z. Ryjáček and P. Vrána, A closure for 1-Hamilton-connectedness in claw-free graphs, J. Graph Theory 75 (2014) 358–376. https://doi.org/10.1002/jgt.2174310.1002/jgt.21743 Search in Google Scholar

[19] Y. Shao, Claw-Free Graphs and Line Graphs, Ph.D. Dissertation (West Virginia University, 2005). Search in Google Scholar

[20] C. Thomassen, Reflections on graph theory, J. Graph Theory 10 (1986) 309–324. https://doi.org/10.1002/jgt.319010030810.1002/jgt.3190100308 Search in Google Scholar

[21] S. Zhan, Hamiltonian connectedness of line graphs, Ars Combin. 22 (1986) 89–95. Search in Google Scholar

• Chorded k-Pancyclic and Weakly k-Pancyclic Graphs

• On s-Hamiltonian-Connected Line Graphs

• On M_f-Edge Colorings of Graphs

• Beta Invariant and Chromatic Uniqueness of Wheels

• Cubic Graphs Having Only k-Cycles in Each 2-Factor

• Distance-Local Rainbow Connection Number

• On a Graph Labelling Conjecture Involving Coloured Labels

• Graph Grabbing Game on Graphs with Forbidden Subgraphs

• On the Broadcast Independence Number of Locally Uniform 2-Lobsters

• Cycles of Many Lengths in Balanced Bipartite Digraphs on Dominating and Dominated Degree Conditions

• The Turán Number for 4 · S_ℓ¹

• Panchromatic Patterns By Paths

• Singular Turán Numbers and Worm-Colorings

• The Linear Arboricity of Graphs with Low Treewidth

• Decomposing 10-Regular Graphs into Paths of Length 5

• The Decycling Number of a Planar Graph Covered By K₄-Subgraphs

• Degree Sum Condition for Vertex-Disjoint 5-Cycles

• Finding Dominating Induced Matchings in P₉-Free Graphs in Polynomial Time

• L(2, 1)-Labeling of the Iterated Mycielski Graphs of Graphs and Some Problems Related to Matching Problems

• (C₃, C₄, C₅, C₇)-Free Almost Well-Dominated Graphs

• On the Equality of Domination Number and 2-Domination Number

• Bounds on the Double Italian Domination Number of a Graph

• The Achromatic Number of the Cartesian Product of K₆ and K_q

• More on the Rainbow Disconnection in Graphs

• Linear Arboricity of 1-Planar Graphs

• Edge Degree Conditions for Dominating and Spanning Closed Trails

• Extremal Graphs for Even Linear Forests in Bipartite Graphs

• ℓ-Covering k-Hypergraphs are Quasi-Eulerian

• Zero and Total Forcing Dense Graphs

• The Walks and CDC of Graphs with the Same Main Eigenspace

• Burnside Chromatic Polynomials of Group-Invariant Graphs

• Total and Paired Domination Stability in Prisms

• Generalized Turán Problems for Small Graphs

• The Achromatic Number of K₆ □ K_q Equals 2q + 3 If q ≥ 41 is Odd

• Total 2-Domination Number in Digraphs and Its Dual Parameter

• Metric Dimension and Diameter in Bipartite Graphs

• A Decomposition for Digraphs with Minimum Outdegree 3 Having No Vertex Disjoint Cycles of Different Lengths

• On Semi-Transitive Orientability of Triangle-Free Graphs

• Countable Graphs Are Majority 3-Choosable

• Identifying Codes in the Direct Product of a Path and a Complete Graph

• Determining Number and Cost of Generalized Mycielskian Graphs

• A Note on Packing of Uniform Hypergraphs

• Set-Sequential Labelings of Odd Trees

• Lower Boundary Independent Broadcasts in Trees

• Minimal Graphs with Disjoint Dominating and Total Dominating Sets

• On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs

• Edge Intersection Hypergraphs

• On Distance Magic Labelings of Hamming Graphs and Folded Hypercubes

• An Upper Bound on the Chromatic Number of 2-Planar Graphs

• On Subgraphs with Prescribed Eccentricities

• Double Roman and Double Italian Domination

• An Improved Bound on the Chromatic Number of the Pancake Graphs

• Covering the Edges of a Random Hypergraph by Cliques

• Choosability with Separation of Cycles and Outerplanar Graphs

• More on Signed Graphs with at Most Three Eigenvalues

• The Neighbor-Locating-Chromatic Number of Trees and Unicyclic Graphs

• Edge-Maximal Graphs with Cutwidth at Most Three

• The Petersen and Heawood Graphs Make Up Graphical Twins Via Induced Matchings

• A Note About Monochromatic Components in Graphs of Large Minimum Degree

• New Results on Type 2 Snarks¹

• Relationship among B1-EPG, VPT and EPT Graphs Classes

• Relaxed DP-Coloring and another Generalization of DP-Coloring on Planar Graphs without 4-Cycles and 7-Cycles

• A Characterization of Internally 4-Connected {P₁₀ − {V₁, V₂}}-Minor-Free Graphs

• Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs

• New Bounds on Domination and Independence in Graphs¹

• Two Sufficient Conditions for Component Factors in Graphs

• The Turán Number of Spanning Star Forests

• Well-Covered Token Graphs

• On the Metric Dimensions for Sets of Vertices

• Hop Domination in Chordal Bipartite Graphs

• Minimizing the Number of Complete Bipartite Graphs in a K_s-Saturated Graph

• Some Results on Path-Factor Critical Avoidable Graphs

• Double Total Dominator Chromatic Number of Graphs

• Forbidden Subgraphs for Existences of (Connected) 2-Factors of a Graph

• The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem

• Extending Potočnik and Šajna’s Conditions on the Existence of Vertex-Transitive Self-Complementary k-Hypergraphs

• On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs

• A Note on the Upper Bounds on the Size of Bipartite and Tripartite 1-Embeddable Graphs on Surfaces

• Spanning Trees with a Bounded Number of Branch Vertices in a K_1,4-Free Graph

• Coalition Graphs of Paths, Cycles, and Trees

• A Characterization of Uniquely Representable Graphs

• On P₅-Free Locally Split Graphs

• Bounds on the Total Double Roman Domination Number of Graphs

• On the ρ-Subdivision Number of Graphs

• Scaffold for the Polyhedral Embedding of Cubic Graphs

• Vertex-Edge Domination in Interval and Bipartite Permutation Graphs

• Domination Game: Effect of Edge Contraction and Edge Subdivision

• On Q-Connected Chordal Graphs with Minimum Number of Spanning Trees

• Strong and Weak Perfect Digraph Theorems for Perfect, α-Perfect and Strictly Perfect Digraphs

• About an Extremal Problem of Bigraphic Pairs with a Realization Containing K_s,t¹

• Optimal Error-Detecting Open-Locating-Dominating Set on the Infinite Triangular Grid

• The Graph Grabbing Game on Blow-ups of Trees and Cycles

• Flippable Edges in Triangulations on Surfaces

• A Note on Forcing 3-Repetitions in Degree Sequences

• Vertex Partitioning of Graphs Into Odd Induced Subgraphs

• On the Ramsey Numbers of Non-Star Trees Versus Connected Graphs of Order Six

• Daisy Hamming Graphs

• Strengthening Some Complexity Results on Toughness of Graphs

• Unique Minimum Semipaired Dominating Sets in Trees

• Nested Locally Hamiltonian Graphs and the Oberly-Sumner Conjecture

• On Conditional Connectivity of the Cartesian Product of Cycles

• On Small Balanceable, Strongly-Balanceable and Omnitonal Graphs

• Representing Split Graphs by Words

• More Aspects of Arbitrarily Partitionable Graphs

• Antimagic Labeling of Some Biregular Bipartite Graphs

• Improved Bounds for Some Facially Constrained Colorings

• Equimatchable Bipartite Graphs

• The Threshold Dimension and Irreducible Graphs

• More Tales of Hoffman: Bounds for the Vector Chromatic Number of a Graph

• The Existence of Path-Factor Covered Graphs

• Domination Parameters of the Unitary Cayley Graph of 𝕑/n𝕑

• Efficient (j, k)-Dominating Functions

• Elimination Properties for Minimal Dominating Sets of Graphs

• Cyclic Permutations in Determining Crossing Numbers