The competition number of a graph with exactly two holes

DOI10.1007/S10878-010-9331-9MaRDI QIDQ434196zbMATH OpenOpenAlexFDO

Authors Bo-Jr Li, Gerard Jennhwa Chang

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

competition graphchordal graphcompetition numberholechordless cycle

Mathematics Subject Classification ID

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

Recommendations

• The competition number of a graph with exactly \(h\) holes, all of which are independent
• The competition number of a graph with exactly two holes.
• The competition number of a graph having exactly one hole
• The competition number of a graph whose holes do not overlap much
• scientific article; zbMATH DE number 434915

Cites work

• scientific article; zbMATH DE number 4187846 (Why is no real title available?)
• Competition numbers of graphs with a small number of triangles
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• On rigid circuit graphs
• On the Computation of the Competition Number of a Graph
• The competition number of a graph having exactly one hole
• The competition number of a graph with exactly \(h\) holes, all of which are independent

Cited in

(10)

• scientific article; zbMATH DE number 434915 (Why is no real title available?)
• The competition numbers of Hamming graphs with diameter at most three
• The competition number of a graph and the dimension of its hole space
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• The competition numbers of Johnson graphs
• The competition number of a graph with exactly two holes.
• The elimination procedure for the competition number
• The competition number of a graph having exactly one hole
• Competition numbers of complete \(r\)-partite graphs
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE

This page was built for publication: The competition number of a graph with exactly two holes

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