Minimizing Dependence between Graphs
Abstract
References
Index Terms
- Minimizing Dependence between Graphs
Recommendations
Interference-Minimizing Colorings of Regular Graphs
Communications problems that involve frequency interference, such as the channel assignment problem in the design of cellular telephone networks, can be cast as graph coloring problems in which the frequencies (colors) assigned to an edge's vertices ...
Comparability Graphs Among Cover-Incomparability Graphs
Algorithms and Discrete Applied MathematicsAbstractComparability graphs and cover-incomparability graphs (C-I graphs) are two interesting classes of graphs from posets. Comparability graph of a poset is a graph with vertex set V and two vertices u and v are adjacent in V if u and v are ...
Collapsible graphs and Hamiltonian connectedness of line graphs
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-an update, in: Ku Tung-Hsin (Ed.), Combinatorics and Graph Theory, vol. 95, ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Ee-Peng Lim,
- Marianne Winslett,
- Program Chairs:
- Mark Sanderson,
- Ada Fu,
- Jimeng Sun,
- Shane Culpepper,
- Eric Lo,
- Joyce Ho,
- Debora Donato,
- Rakesh Agrawal,
- Yu Zheng,
- Carlos Castillo,
- Aixin Sun,
- Vincent S. Tseng,
- Chenliang Li
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 190Total Downloads
- Downloads (Last 12 months)6
- 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