Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors.
- Published in:
- Journal of Graph Theory, 2011, v. 67, n. 2, p. 124, doi. 10.1002/jgt.20521
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2011 AND VI 67 AND IP 2
Results: 7
1
2
Independence, odd girth, and average degree.
- Published in:
- Journal of Graph Theory, 2011, v. 67, n. 2, p. 96, doi. 10.1002/jgt.20518
- By:
- Publication type:
- Article
3
Constrained Ramsey numbers for rainbow matching.
- Published in:
- Journal of Graph Theory, 2011, v. 67, n. 2, p. 91, doi. 10.1002/jgt.20517
- By:
- Publication type:
- Article
4
Combinatorial theorems about embedding trees on the real line.
- Published in:
- Journal of Graph Theory, 2011, v. 67, n. 2, p. 153, doi. 10.1002/jgt.20608
- By:
- Publication type:
- Article
5
List strong linear 2-arboricity of sparse graphs.
- Published in:
- Journal of Graph Theory, 2011, v. 67, n. 2, p. 83, doi. 10.1002/jgt.20516
- By:
- Publication type:
- Article
6
Compact topological minors in graphs.
- Published in:
- Journal of Graph Theory, 2011, v. 67, n. 2, p. 139, doi. 10.1002/jgt.20522
- By:
- Publication type:
- Article
7
Upper bounds on the sum of powers of the degrees of a simple planar graph.
- Published in:
- Journal of Graph Theory, 2011, v. 67, n. 2, p. 112, doi. 10.1002/jgt.20519
- By:
- Publication type:
- Article