Critical points with discrete Morse theory
Abstract
Index Terms
- Critical points with discrete Morse theory
Recommendations
Factor-critical property in 3-dominating-critical graphs
A vertex subset S of a graph G is a dominating set if every vertex of G either belongs to S or is adjacent to a vertex of S. The cardinality of a smallest dominating set is called the dominating number of G and is denoted by @c(G). A graph G is said to ...
On 4-γt -critical graphs of diameter two
A vertex subset S of graph G is a total dominating set of G if every vertex of G is adjacent to a vertex in S. For a graph G with no isolated vertex, the total domination number of G, denoted by @c"t(G), is the minimum cardinality of a total dominating ...
Matchings in 3-vertex-critical graphs: The odd case
A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjacent to one in D. The cardinality of any smallest dominating set in G is denoted by @c(G) and called the domination number of G. Graph G is said to be @c-...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 108Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in