Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
On clique-perfect and K-perfect graphs
Sort
relevance
views
votes
recent
update
View
thumb
title
25
click to vote
SIAMDM
2008
101
views
more
SIAMDM 2008
»
Hamilton Cycles in Random Lifts of Directed Graphs
13 years 8 months ago
Download
www.math.cmu.edu
An n-lift of a digraph K, is a digraph with vertex set V (K)
Prasad Chebolu, Alan M. Frieze
claim paper
Read More »
26
click to vote
ENDM
2008
118
views
more
ENDM 2008
»
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
13 years 8 months ago
Download
mate.dm.uba.ar
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
Flavia Bonomo, Guillermo Durán, Francisco J...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »