Found: 15
Select item for more details and to access through your institution.
On a Hypergraph Matching Problem.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 377, doi. 10.1007/s00373-005-0628-x
- By:
- Publication type:
- Article
Circulant Double Coverings of a Circulant Graph of Valency Four.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 385, doi. 10.1007/s00373-005-0623-2
- By:
- Publication type:
- Article
The Hilbert Series of the Clique Complex.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 401, doi. 10.1007/s00373-005-0634-z
- By:
- Publication type:
- Article
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 407, doi. 10.1007/s00373-005-0635-y
- By:
- Publication type:
- Article
Structural Remarks on Bipartite Graphs with Unique f-Factors.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 421, doi. 10.1007/s00373-005-0631-2
- By:
- Publication type:
- Article
Rigid Two-Dimensional Frameworks with Three Collinear Points.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 427, doi. 10.1007/s00373-005-0629-9
- By:
- Publication type:
- Article
Contractible Edges in 7-Connected Graphs.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 445, doi. 10.1007/s00373-005-0621-4
- By:
- Publication type:
- Article
Super Restricted Edge Connectivity of Regular Graphs.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 459, doi. 10.1007/s00373-005-0600-9
- By:
- Publication type:
- Article
On Group Chromatic Number of Graphs.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 469, doi. 10.1007/s00373-005-0625-0
- By:
- Publication type:
- Article
Trade Spectrum of K <sub>4</sub> − e.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 475, doi. 10.1007/s00373-005-0633-0
- By:
- Publication type:
- Article
Fan-Type Theorem for Long Cycles Containing a Specified Edge.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 489, doi. 10.1007/s00373-005-0622-3
- By:
- Publication type:
- Article
Two Paths Joining Given Vertices in 2 k-Edge-Connected Graphs.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 503, doi. 10.1007/s00373-005-0626-z
- By:
- Publication type:
- Article
Perfect Matchings of Generalized Polyomino Graphs.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 515, doi. 10.1007/s00373-005-0624-1
- By:
- Publication type:
- Article
The Determination of the Total Chromatic Number of Series-Parallel Graphs with ( G) ≥ 4.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 531, doi. 10.1007/s00373-005-0620-5
- By:
- Publication type:
- Article
RHPMDs and FHPMDs with k = 4 and Type 4<sup> u </sup>.
- Published in:
- Graphs & Combinatorics, 2005, v. 21, n. 4, p. 541, doi. 10.1007/s00373-005-0630-3
- By:
- Publication type:
- Article