The competition number of a graph with exactly two holes
From MaRDI portal
Publication:434196
DOI10.1007/S10878-010-9331-9zbMATH Open1244.90233OpenAlexW2139042312MaRDI QIDQ434196FDOQ434196
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
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
- On rigid circuit graphs
- Competition numbers of graphs with a small number of triangles
- On the Computation of the Competition Number of a Graph
- The competition number of a graph with exactly \(h\) holes, all of which are independent
- The competition number of a graph having exactly one hole
- GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- 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)
