Volume 206

Pages 1-220 (19 June 2016)

Actions for selected articles



Receive an update when the latest issues in this journal are published
Sign in to set up alerts
    1. Contents

      Pages v-vi
      Download PDF
  1. Contributions

    1. House-swapping with divorcing and engaged pairs

      Pages 1-8
      Download PDF
    2. On Wiener and multiplicative Wiener indices of graphs

      Pages 9-14
      Download PDF
    3. Adjacency polynomials of digraph transformations

      Pages 15-38
      Download PDF
    4. Complexity aspects of the triangle path convexity

      Pages 39-47
      Download PDF
    5. Intersection graphs of L-shapes and segments in the plane

      Pages 48-55
      Download PDF
    6. Disjoint Hamilton cycles in transposition graphs

      Pages 56-64
      Download PDF
    7. Pages 65-72
      Download PDF
    8. Detour trees

      Pages 73-80
      Download PDF
    9. Pages 81-89
      Download PDF
    10. On the extreme eccentric distance sum of graphs with some given parameters

      Pages 90-99
      Download PDF
    11. Pages 100-108
      Download PDF
    12. Improving the characterization of P-stability for applications in network privacy

      Pages 109-114
      Download PDF
    13. On del-robust primitive words

      Pages 115-121
      Download PDF
    14. Core-based criterion for extreme supermodular functions

      Pages 122-151
      Download PDF
    15. On the further relation between the (revised) Szeged index and the Wiener index of graphs

      Pages 152-164
      Download PDF
    16. A minimax result for perfect matchings of a polyomino graph

      Pages 165-171
      Download PDF
    17. Clique cover products and unimodality of independence polynomials

      Pages 172-180
      Download PDF
  2. Notes

    1. Largest domination number and smallest independence number of forests with given degree sequence

      Pages 181-187
      Download PDF
    2. On the uniqueness of some girth eight algebraically defined graphs

      Pages 188-194
      Download PDF
    3. On the distance spread of cacti and bicyclic graphs

      Pages 195-202
      Download PDF
    4. The maximum matching energy of bicyclic graphs with even girth

      Pages 203-210
      Download PDF
    5. On the geodetic iteration number of the contour of a graph

      Pages 211-214
      Download PDF
    6. Neighbor sum distinguishing total choosability of planar graphs without 4-cycles

      Pages 215-219
      Download PDF

ISSN: 0166-218X

title_temp <",c,' onload="var d=',n,";d.getElementsByTagName('head')[0].",d,"(d.",g,"('script')).",i,"='",a.l,"'\">"].join("")}var c="body",e=h[c];if(!e)return setTimeout(q,100);a.P(1);var d="appendChild",g="createElement",i="src",k=h[g]("div"),l=k[d](h[g]("div")),f=h[g]("iframe"),n="document",p;"none";e.insertBefore(k,e.firstChild).id=o+"-"+j;f.frameBorder="0";"-frame-"+j;/MSIE[ ]+6/.test(navigator.userAgent)&&(f[i]="javascript:false");f.allowTransparency="true";l[d](f);try{f.contentWindow[n].open()}catch(s){a.domain=h.domain,p="javascript:var d="+n+".open();d.domain='"+h.domain+"';",f[i]=p+"void(0);"}try{var r=f.contentWindow[n];r.write(b());r.close()}catch(t){f[i]=p+'d.write("'+b().replace(/"/g,String.fromCharCode(92)+'"')+'");d.close();'}a.P(2)};a.l&&setTimeout(q,0)})()}();c[b].lv="1";return c[b]}var o="lightningjs",k=window[o]=g(o);k.require=g;k.modules=c}({}); window.usabilla_live = lightningjs.require("usabilla_live", ""); var customData = {"accessType":"ae:ANON_GUEST","accountId":"ae:228598"}; if(window.pageData && pageData.content && pageData.content[0]) { customData.entitlementType = pageData.content[0].entitlementType; } if(window.pageData && pageData.visitor) { customData.accessType = pageData.visitor.accessType; customData.accountId = pageData.visitor.accountId; customData.loginStatus = pageData.visitor.loginStatus; } usabilla_live("data", {"custom": customData });