Sciweavers

250 search results - page 5 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
DM
2007
106views more  DM 2007»
14 years 11 months ago
The Roberts characterization of proper and unit interval graphs
In this note, a constructive proof is given that the classes of proper interval graphs and unit interval graphs coincide, a result originally established by Fred S. Roberts. Addit...
Frédéric Gardi
FLOPS
2004
Springer
15 years 5 months ago
Complete Axiomatization of an Algebraic Construction of Graphs
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
Mizuhito Ogawa
DISOPT
2006
110views more  DISOPT 2006»
14 years 11 months ago
New facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
14 years 11 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan
DISOPT
2008
93views more  DISOPT 2008»
14 years 11 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson