A simpler characterization of a spectral lower bound on the clique number
Year of publication: |
2010
|
---|---|
Authors: | Yıldırım, E. Alper |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 71.2010, 2, p. 267-281
|
Subject: | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory |
-
Almost all Berge graphs are perfect
Prömel, Hans Jürgen, (1991)
-
A supernodal formulation of vertex colouring with applications in course timetabling
Burke, Edmund K., (2010)
-
Solving shortest path problems with a weight constraint and replenishment arcs
Smith, Olivia J., (2012)
- More ...
-
An algorithm and a core set result for the weighted euclidean one-center problem
Kumar, Piyush, (2009)
-
Kumar, Piyush, (2011)
-
John, Elizabeth, (2008)
- More ...