Found: 14
Select item for more details and to access through your institution.
Laplacian Spectrum of Weakly Quasi-threshold Graphs.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 273, doi. 10.1007/s00373-008-0785-9
- By:
- Publication type:
- Article
Rainbow Numbers for Cycles with Pendant Edges.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 327, doi. 10.1007/s00373-008-0786-8
- By:
- Publication type:
- Article
Perfect Matchings and K -Tilings in Hypergraphs of Large Codegree.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 391, doi. 10.1007/s00373-008-0787-7
- By:
- Publication type:
- Article
Disproof of a Conjecture on the Subdivision Domination Number of a Graph.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 309, doi. 10.1007/s00373-008-0788-6
- By:
- Publication type:
- Article
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 237, doi. 10.1007/s00373-008-0789-5
- By:
- Publication type:
- Article
On 2-Detour Subgraphs of the Hypercube.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 265, doi. 10.1007/s00373-008-0790-z
- By:
- Publication type:
- Article
Embedding Partial 4-cycle Systems of Arbitrary Index.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 367, doi. 10.1007/s00373-008-0791-y
- By:
- Publication type:
- Article
Paired-Domination in P <sub>5</sub>-Free Graphs.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 303, doi. 10.1007/s00373-008-0792-x
- By:
- Publication type:
- Article
The Unbalance of Set Systems.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 361, doi. 10.1007/s00373-008-0793-9
- By:
- Publication type:
- Article
Equitable Specialized Block-Colourings for Steiner Triple Systems.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 313, doi. 10.1007/s00373-008-0794-8
- By:
- Publication type:
- Article
Generalized Thrackles and Geometric Graphs in $${\mathbb{R}}^3$$ with No Pair of Strongly Avoiding Edges.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 373, doi. 10.1007/s00373-008-0796-6
- By:
- Publication type:
- Article
Total Domination in Graphs with Given Girth.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 333, doi. 10.1007/s00373-008-0797-5
- By:
- Publication type:
- Article
On the Acyclic Chromatic Number of Hamming Graphs.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 349, doi. 10.1007/s00373-008-0798-4
- By:
- Publication type:
- Article
Hadwiger Number and the Cartesian Product of Graphs.
- Published in:
- Graphs & Combinatorics, 2008, v. 24, n. 4, p. 291, doi. 10.1007/s00373-008-0795-7
- By:
- Publication type:
- Article