Found: 10
Select item for more details and to access through your institution.
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 621, doi. 10.1007/s00373-010-0991-0
- By:
- Publication type:
- Article
All 4-Edge-Connected HHD-Free Graphs are $${\mathbb{Z}_3}$$-Connected.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 647, doi. 10.1007/s00373-010-0995-9
- By:
- Publication type:
- Article
Turán Numbers for Disjoint Copies of Graphs.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 661, doi. 10.1007/s00373-010-0999-5
- By:
- Publication type:
- Article
Weakly Cycle Complementary 3-Partite Tournaments.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 669, doi. 10.1007/s00373-010-0993-y
- By:
- Publication type:
- Article
Perfect Matchings in Total Domination Critical Graphs.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 685, doi. 10.1007/s00373-010-1000-3
- By:
- Publication type:
- Article
Construction of Hamilton Path Tournament Designs.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 703, doi. 10.1007/s00373-010-0998-6
- By:
- Publication type:
- Article
On Idomatic Partitions of Direct Products of Complete Graphs.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 713, doi. 10.1007/s00373-010-0997-7
- By:
- Publication type:
- Article
Sums of Powers of the Degrees of Graphs with k Cut Edges.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 727, doi. 10.1007/s00373-010-0996-8
- By:
- Publication type:
- Article
On the Chromatic Number of H-Free Graphs of Large Minimum Degree.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 741, doi. 10.1007/s00373-010-0994-x
- By:
- Publication type:
- Article
On Roman, Global and Restrained Domination in Graphs.
- Published in:
- Graphs & Combinatorics, 2011, v. 27, n. 5, p. 755, doi. 10.1007/s00373-010-0992-z
- By:
- Publication type:
- Article