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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
721
search results - page 10 / 145
»
Bounds on the k-domination number of a graph
Sort
relevance
views
votes
recent
update
View
thumb
title
114
click to vote
DISOPT
2008
55
views
more
DISOPT 2008
»
A sequential elimination algorithm for computing bounds on the clique number of a graph
15 years 6 months ago
Download
www.gerad.ca
Bernard Gendron, Alain Hertz, Patrick St-Louis
claim paper
Read More »
144
click to vote
EJC
2008
95
views
Information Technology
»
more
EJC 2008
»
The upper bound on k-tuple domination numbers of graphs
15 years 6 months ago
Download
homepage.ntu.edu.tw
Gerard J. Chang
claim paper
Read More »
116
click to vote
COMBINATORICS
2006
134
views
more
COMBINATORICS 2006
»
Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers
15 years 6 months ago
Download
www.math.nyu.edu
János Pach, Dömötör Pá...
claim paper
Read More »
124
Voted
COMBINATORICS
2007
84
views
more
COMBINATORICS 2007
»
A New Upper Bound on the Total Domination Number of a Graph
15 years 6 months ago
Download
www.combinatorics.org
Michael A. Henning, Anders Yeo
claim paper
Read More »
177
click to vote
DM
2002
116
views
more
DM 2002
»
Star forests, dominating sets and Ramsey-type problems
15 years 5 months ago
Download
maven.smith.edu
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
Sheila Ferneyhough, Ruth Haas, Denis Hanson, Gary ...
claim paper
Read More »
« Prev
« First
page 10 / 145
Last »
Next »