The competition number of a graph with exactly two holes

DOI10.1007/s10878-010-9331-9zbMath1244.90233OpenAlexW2139042312MaRDI QIDQ434196

Gerard Jennhwa Chang, Bo-Jr Li

Publication date: 10 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/238852/-1/06.pdf

zbMATH Keywords

holechordal graphcompetition graphcompetition numberchordless cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items

Competition numbers of complete \(r\)-partite graphs

Cites Work

• Unnamed Item
• On rigid circuit graphs
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• Competition numbers of graphs with a small number of triangles
• The competition number of a graph having exactly one hole
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• On the Computation of the Competition Number of a Graph