Pages that link to "Item:Q1362093"
From MaRDI portal
The following pages link to On a closure concept in claw-free graphs (Q1362093):
Displaying 50 items.
- On the line graph of a graph with diameter 2 (Q2219967) (← links)
- Lai's conditions for spanning and dominating closed trails (Q2260637) (← links)
- Closure operation for even factors on claw-free graphs (Q2275395) (← links)
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices (Q2282467) (← links)
- On the independence number of traceable 2-connected claw-free graphs (Q2312072) (← links)
- Spanning trails in a 2-connected graph (Q2325757) (← links)
- The local structure of claw-free graphs without induced generalized bulls (Q2334073) (← links)
- Equivalence of Jackson's and Thomassen's conjectures (Q2349510) (← links)
- Hamiltonian claw-free graphs with locally disconnected vertices (Q2352071) (← links)
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs (Q2357785) (← links)
- Circumferences of 3-connected claw-free graphs. II. (Q2359952) (← links)
- Forbidden pairs of disconnected graphs for traceability in connected graphs (Q2359961) (← links)
- Even factors with a bounded number of components in iterated line graphs (Q2360854) (← links)
- Heavy subgraphs, stability and Hamiltonicity (Q2364090) (← links)
- Tank-ring factors in supereulerian claw-free graphs (Q2376088) (← links)
- Hamiltonian paths in spanning subgraphs of line graphs (Q2400567) (← links)
- Cycles through all finite vertex sets in infinite graphs (Q2400982) (← links)
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs (Q2404404) (← links)
- Hamiltonicities of double domination critical and stable claw-free graphs (Q2416952) (← links)
- Hamiltonian connected hourglass free line graphs (Q2427529) (← links)
- Group connectivity and group colorings of graphs --- a survey (Q2430307) (← links)
- Circumferences of regular claw-free graphs (Q2433725) (← links)
- On Hamiltonicity of \{claw, net\}-free graphs (Q2433732) (← links)
- On 2-factors with a bounded number of odd components (Q2439124) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Hamiltonian claw-free graphs involving minimum degrees (Q2446336) (← links)
- Even subgraphs of bridgeless graphs and 2-factors of line graphs (Q2461204) (← links)
- On the number of components in 2-factors of claw-free graphs (Q2461206) (← links)
- Forbidden subgraphs that imply 2-factors (Q2477381) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Hamiltonicity in 3-connected claw-free graphs (Q2496201) (← links)
- Every 3-connected, essentially 11-connected line graph is Hamiltonian (Q2496206) (← links)
- 2-factors with bounded number of components in claw-free graphs (Q2514163) (← links)
- Forbidden pairs and the existence of a dominating cycle (Q2515588) (← links)
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected (Q2519848) (← links)
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs (Q2637726) (← links)
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs (Q2659232) (← links)
- Polynomially determining spanning connectivity of locally connected line graphs (Q2661222) (← links)
- Strongly even cycle decomposable 4-regular line graphs (Q2662802) (← links)
- Two completely independent spanning trees of claw-free graphs (Q2675841) (← links)
- On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs (Q2699918) (← links)
- Edge-dominating trails in AT-free graphs (extended abstract) (Q2741346) (← links)
- On factors of 4-connected claw-free graphs (Q2744573) (← links)
- Quartic graphs with every edge in a triangle (Q2811200) (← links)
- The edge-closure of a claw-free graph is the line graph of a multigraph. (Q2846645) (← links)
- Hamilton cycles in 6-connected claw-free graphs (extended abstract) (Q2851482) (← links)
- Stability of hereditary graph classes under closure operations (Q2852612) (← links)
- 2-factors in claw-free graphs (Q2857347) (← links)
- Maximal \(K_3\)'s and hamiltonicity of 4-connected claw-free graphs (Q2888878) (← links)
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038) (← links)
