An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs

DOI10.11650/TWJM/1500407434MaRDI QIDQ698558zbMATH OpenOpenAlexWikidataFDO

Authors Hung Q. Ngo, Du Ding-Zhu

Publication date 2 April 2003

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL http://www.math.nthu.edu.tw/~tjm/abstract/0206/tjm0206_9.html

zbMATH Keywords

switching networks

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• An algorithm for identifying cycle-plus-triangles graphs
• scientific article; zbMATH DE number 524136
• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
• scientific article; zbMATH DE number 970801
• A conjecture on triangles of graphs

Cited in

(5)

• An algorithm for identifying cycle-plus-triangles graphs
• scientific article; zbMATH DE number 524136 (Why is no real title available?)
• On 3-stage Clos networks with different nonblocking requirements on two types of calls
• Proof of the Kalai-Meshulam conjecture
• scientific article; zbMATH DE number 970801 (Why is no real title available?)

This page was built for publication: An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698558)