ExLibris header image
SFX Logo
Title: A hierarchy of self-clique graphs
Source:

Discrete Mathematics [0012-365X] Larrión, F yr:2004


Collapse list of basic services Basic
Sorry, no full text available...
Please use the document delivery service (see below)  
Holding information
Holdings in library search engine ALBERT GO
Document delivery
Request document via Library/Bibliothek GO
Users interested in this article also expressed an interest in the following:
1. Larrion, F. "The clique operator on cographs and serial graphs." Discrete mathematics 282.1 (2004): 183-191. Link to SFX for this item
2. Boros, E. "Difference graphs." Discrete mathematics 276.1 (2004): 59-64. Link to SFX for this item
3. Eckhoff, J. "A new Turan-type theorem for cliques in graphs." Discrete mathematics 282.1 (2004): 113-122. Link to SFX for this item
4. Cenek, E. "Maximum independent set and maximum clique algorithms for overlap graphs." Discrete applied mathematics 131.1 (2003): 77-91. Link to SFX for this item
5. Bacso, G. "Coloring the maximal cliques of graphs." SIAM journal on discrete mathematics 17.3 (2004): 361-376. Link to SFX for this item
6. Perepelitsa, I. G. "Bounds on the chromatic number of intersection graphs of sets in the plane." Discrete mathematics 262.1-3 (2003): 221-227. Link to SFX for this item
Select All Clear All

Expand list of advanced services Advanced
A service provided by the Library of the Wissenschaftspark Albert Einstein, Potsdam, Germany.
© 2005 SFX by Ex Libris Inc.