3268 search results - page 70 / 654 » The hub number of a graph |
164
click to vote
ENDM
2008
15 years 6 months ago
2008
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...
164
click to vote
DAM
2008
15 years 6 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
177
click to vote
DM
2002
15 years 6 months ago
2002
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...
152
click to vote
ISM
2006
IEEE
16 years 6 days ago
2006
IEEE
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
154
click to vote
DM
2002
15 years 6 months ago
2002
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...