Result 1 to 17 of 17 total
House of graphs: A database of interesting graphs. (English)
Discrete Appl. Math. 161, No. 1-2, 311-314 (2013).
1
Trees with given stability number and minimum number of stable sets. (English)
Graphs Comb. 28, No. 2, 167-187 (2012).
2
Fibonacci index and stability number of graphs: a polyhedral study. (English)
J. Comb. Optim. 18, No. 3, 207-228 (2009).
3
Fibonacci index and stability number of graphs: a polyhedral study. (English)
Comput. Res. Repos. 2008, Article No. 0811.1449 (2008).
4
Turán graphs, stability number, and Fibonacci index. (English)
Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21‒24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 127-138 (2008).
5
Turán graphs, stability number, and Fibonacci index. (English)
Comput. Res. Repos. 2008, Article No. 0802.3284 (2008).
6
io-port 05383024 Christophe, Julie;
Dewez, Sophie;
Doignon, Jean-Paul;
Fasbender, Gilles;
Grégoire, Philippe;
Huygens, David;
Labbé, Martine;
Elloumi, Sourour;
Mélot, Hadrien;
Yaman, Hande
Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships. (English)
Networks 52, No. 4, 287-298 (2008).
7
Facet defining inequalities among graph invariants: The system graphedron. (English)
Discrete Appl. Math. 156, No. 10, 1875-1891 (2008).
8
Turán graphs, stability number, and Fibonacci index (English)
COCOA, 127-138 (2008).
9
Variable neighborhood search for extremal graphs. IX: Bounding the irregularity of a graph. (English)
Fajtlowicz, Siemion (ed.) et al., Graphs and discovery. Proceedings of the DIMACS working group, computer-generated conjectures from graph theoretic and chemical databases, November 12‒16, 2001, and DIMACS public event, graph theory day 42, November 10, 2001, Piscataway, NJ, USA. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3761-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 69, 253-264 (2005).
10
What forms do interesting conjectures have in graph theory? (English)
Fajtlowicz, Siemion (ed.) et al., Graphs and discovery. Proceedings of the DIMACS working group, computer-generated conjectures from graph theoretic and chemical databases, November 12‒16, 2001, and DIMACS public event, graph theory day 42, November 10, 2001, Piscataway, NJ, USA. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3761-3/hbk). DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 69, 231-251 (2005).
11
A tight analysis of the maximal matching heuristic. (English)
Wang, Lusheng (ed.), Computing and combinatorics. 11th annual international conference, COCOON 2005, Kunming, China, August 16‒29, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28061-8/pbk). Lecture Notes in Computer Science 3595, 701-709 (2005).
12
Variable neighborhood search for extremal graphs. 10. Comparison of irregularity indices for chemical trees (English)
Journal of Chemical Information and Modeling 45, No. 2, 222-230 (2005).
13
A tight analysis of the maximal matching heuristic (English)
COCOON, 701-709 (2005).
14
Variable neighborhood search for extremal graphs, 6. Analyzing bounds for the connectivity index (English)
Journal of Chemical Information and Computer Sciences 43, No. 1, 1-14 (2003).
15
Integral complete split graphs. (English)
Publ. Elektroteh. Fak., Univ. Beogr., Ser. Mat. 13, 89-95 (2002).
16
Computers and discovery in algebraic graph theory. (English)
Linear Algebra Appl. 356, No.1-3, 211-230 (2002).
17
Result 1 to 17 of 17 total
Start
Contact
Print
General Help
