An Extension of DHH-Erdös Conjecture on Cycle-Plus-Triangle Graphs with Application in Switching Networks
2000-10-20
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
An Extension of DHH-Erdös Conjecture on Cycle-Plus-Triangle Graphs with Application in Switching Networks
Authors
Published Date
2000-10-20
Publisher
Type
Report
Abstract
Consider n disjoint triangles and a cycle on the 3n vertices of the n triangles. In 1986, Du, Hsu, and Hwang conjectured that the union of the n triangles and the cycle has independent number n. Soon later, Paul Erdös improved it to a stronger version that every cycle-plus-triangle graph is 3-colorable. This conjecture was proven by H. Fleischner and M. Stiebitz. In this note, we want to give an extension of the above conjecture with an application in switching networks.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Du, Ding-Zhu; Ngo, Hung Q.. (2000). An Extension of DHH-Erdös Conjecture on Cycle-Plus-Triangle Graphs with Application in Switching Networks. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215442.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.