Graph bandwidth: Difference between revisions

Revision as of 18:14, 18 January 2015

Revision as of 12:57, 29 August 2015

Line 70:

{{reflist}}

*{{cite doi|10.1016/j.ejc.2009.10.010}}

*{{Cite journal | last1 = Chinn | first1 = P. Z. |author1-link=Phyllis Chinn| last2 = Chvátalová | first2 = J. | last3 = Dewdney | first3 = A. K. |author3-link=Alexander Dewdney| last4 = Gibbs | first4 = N. E. | title = The bandwidth problem for graphs and matrices—a survey | journal = Journal of Graph Theory | volume = 6 | pages = 223–254| year = 1982 | doi = 10.1002/jgt.3190060302}}

*{{cite doi|10.1002/jgt.3190060302}}

*{{citation

| last = Chung

Line 124:

| doi=10.4310/joc.2012.v3.n4.a5

}}

*{{Cite journal | last1 = Harper | first1 = L. | title = Optimal numberings and isoperimetric problems on graphs | journal = Journal of Combinatorial Theory | volume = 1 | pages = 385–393 | year = 1966 | doi = 10.1016/S0021-9800(66)80059-5}}

*{{cite doi|10.1016/S0021-9800(66)80059-5}}

*{{Citation

| title = Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques