نتائج البحث

Spanning Trees of a Claw-Free Graph Whose Reducible Stems Have Few Leaves.

• Authors : Ha, Pham Hoang¹

• Source: Studia Scientiarum Mathematicarum Hungarica. 2023, Vol. 60 Issue 1, p2-15. 14p.

تفاصيل العنوان

Spanning trees of a claw-free graph whose reducible stems have few leaves

• Authors : Ha, Pham Hoang

Subjects: Mathematics - Combinatorics; 05C05, 05C70

تفاصيل العنوان

Spanning trees with few peripheral branch vertices in a connected claw-free graph.

• Authors : Hanh, D. D.¹ (AUTHOR)

• Source: Acta Mathematica Hungarica. Feb2023, Vol. 169 Issue 1, p1-14. 14p.

تفاصيل العنوان

Spanning trees in a Claw-free graph whose stems have at most $k$ branch vertices

• Authors : Ha, Pham Hoang

Subjects: Mathematics - Combinatorics

تفاصيل العنوان

The Independence Number Conditions for 2-Factors of a Claw-Free Graph.

• Authors : Lei, Wanpeng^1,2 (AUTHOR) ; Xiong, Liming¹ (AUTHOR); Yin, Jun³ (AUTHOR)

• Source: Axioms (2075-1680). Aug2022, Vol. 11 Issue 8, pN.PAG-N.PAG. 14p.

تفاصيل العنوان

The Independence Number Conditions for 2-Factors of a Claw-Free Graph

• Authors : Wanpeng Lei; Liming Xiong; Jun Yin

Subjects: line graph; essentially k-edge-connected; super-block

• Source: Axioms, Vol 11, Iss 8, p 417 (2022)

تفاصيل العنوان

Finding a smallest odd hole in a claw-free graph using global structure

• Authors : Kennedy, W. Sean; King, Andrew D.

Subjects: Computer Science - Discrete Mathematics; Mathematics - Combinatorics

تفاصيل العنوان

Spanning trees with few peripheral branch vertices in a connected claw-free graph

• Authors : D. D. Hanh

Subjects: General Mathematics

• Source: Acta Mathematica Hungarica. 169:1-14

تفاصيل العنوان

The length of dominating cycle of claw-free graph

• Authors : Xiaodong Chen; Meijin Xu; Lu Zhi

Subjects: Mechanical engineering and machinery; TJ1-1570

• Source: Advances in Mechanical Engineering, Vol 9 (2017)

تفاصيل العنوان

Every 3-connected, locally connected, claw-free graph is Hamilton-connected

• Authors : Asratian, Armen, 1951

• Source: Journal of Graph Theory. 23(2):191-201

تفاصيل العنوان