bwmeta1.element.issn-2083-5892, Volume 31 (2011)

Paired domination in prisms of graphs

Christina M. Mynhardt ; Mark Schurch

Access to full text
Full (PDF)

p. 5-23

The Polish Digital Mathematics Library

Notes on the independence number in the Cartesian product of graphs

G. Abay-Asmerom ; R. Hammack ; C.E. Larson ; D.T. Taylor

Access to full text
Full (PDF)

p. 25-35

The Polish Digital Mathematics Library

Decomposition tree and indecomposable coverings

Andrew Breiner ; Jitender Deogun ; Pierre Ille

Access to full text
Full (PDF)

p. 37-44

The Polish Digital Mathematics Library

Radio numbers for generalized prism graphs

Paul Martinez ; Juan Ortiz ; Maggy Tomova ; Cindy Wyels

Access to full text
Full (PDF)

p. 45-62

The Polish Digital Mathematics Library

Cyclically k-partite digraphs and k-kernels

Hortensia Galeana-Sánchez ; César Hernández-Cruz

Access to full text
Full (PDF)

p. 63-78

The Polish Digital Mathematics Library

A magical approach to some labeling conjectures

Ramon M. Figueroa-Centeno ; Rikio Ichishima ; Francesc A. Muntaner-Batle ; Akito Oshima

Access to full text
Full (PDF)

p. 79-113

The Polish Digital Mathematics Library

The independent domination number of a random graph

Lane Clark ; Darin Johnson

Access to full text
Full (PDF)

p. 129-142

The Polish Digital Mathematics Library

Closure for spanning trees and distant area

Jun Fujisawa ; Akira Saito ; Ingo Schiermeyer

Access to full text
Full (PDF)

p. 143-159

The Polish Digital Mathematics Library

Coloring rectangular blocks in 3-space

Colton Magnant ; Daniel M. Martin

Access to full text
Full (PDF)

p. 161-170

The Polish Digital Mathematics Library

Weak roman domination in graphs

P. Roushini Leely Pushpam ; T.N.M. Malini Mai

Access to full text
Full (PDF)

p. 161-170

The Polish Digital Mathematics Library

The forcing steiner number of a graph

A.P. Santhakumaran ; J. John

Access to full text
Full (PDF)

p. 171-181

The Polish Digital Mathematics Library

Parity vertex colouring of graphs

Piotr Borowiecki ; Kristína Budajová ; Stanislav Jendrol' ; Stanislav Krajci

Access to full text
Full (PDF)

p. 183-195

The Polish Digital Mathematics Library

A characterization of locating-total domination edge critical graphs

Mostafa Blidia ; Widad Dali

Access to full text
Full (PDF)

p. 197-202

The Polish Digital Mathematics Library

Preface

Access to full text
Full (PDF)

p. 207-208

The Polish Digital Mathematics Library

Generalized total colorings of graphs

Mieczysław Borowiecki ; Arnfried Kemnitz ; Massimiliano Marangio ; Peter Mihók

Access to full text
Full (PDF)

p. 209-222

The Polish Digital Mathematics Library

Color-bounded hypergraphs, V: host graphs and subdivisions

Csilla Bujtás ; Zsolt Tuza ; Vitaly Voloshin

Access to full text
Full (PDF)

p. 223-238

The Polish Digital Mathematics Library

On the crossing numbers of G □ Cₙ for graphs G on six vertices

Emília Draženská ; Marián Klešč

Access to full text
Full (PDF)

p. 239-252

The Polish Digital Mathematics Library

On Fulkerson conjecture

Jean-Luc Fouquet ; Jean-Marie Vanherpe

Access to full text
Full (PDF)

p. 253-272

The Polish Digital Mathematics Library

Kernels by monochromatic paths and the color-class digraph

Hortensia Galeana-Sánchez

Access to full text
Full (PDF)

p. 273-281

The Polish Digital Mathematics Library

Monochromatic cycles and monochromatic paths in arc-colored digraphs

Hortensia Galeana-Sánchez ; Guadalupe Gaytán-Gómez ; Rocío Rojas-Monroy

Access to full text
Full (PDF)

p. 283-292

The Polish Digital Mathematics Library

k-kernels in generalizations of transitive digraphs

Hortensia Galeana-Sánchez ; César Hernández-Cruz

Access to full text
Full (PDF)

p. 293-312

The Polish Digital Mathematics Library

Graphs with rainbow connection number two

Arnfried Kemnitz ; Ingo Schiermeyer

Access to full text
Full (PDF)

p. 313-320

The Polish Digital Mathematics Library

The crossing numbers of join products of paths with graphs of order four

Marián Klešč ; Stefan Schrötter

Access to full text
Full (PDF)

p. 321-331

The Polish Digital Mathematics Library

On doubly light vertices in plane graphs

Veronika Kozáková ; Tomáš Madaras

Access to full text
Full (PDF)

p. 333-344

The Polish Digital Mathematics Library

Generalized circular colouring of graphs

Peter Mihók ; Janka Oravcová ; Roman Soták

Access to full text
Full (PDF)

p. 345-356

The Polish Digital Mathematics Library

Interval edge colorings of some products of graphs

Petros A. Petrosyan

Access to full text
Full (PDF)

p. 357-373

The Polish Digital Mathematics Library

Graphs with equal domination and 2-distance domination numbers

Joanna Raczek

Access to full text
Full (PDF)

p. 375-385

The Polish Digital Mathematics Library

Bounds for the rainbow connection number of graphs

Ingo Schiermeyer

Access to full text
Full (PDF)

p. 387-395

The Polish Digital Mathematics Library

Distance independence in graphs

J. Louis Sewell ; Peter J. Slater

Access to full text
Full (PDF)

p. 397-409

The Polish Digital Mathematics Library

Signed domination and signed domatic numbers of digraphs

Lutz Volkmann

Access to full text
Full (PDF)

p. 415-427

The Polish Digital Mathematics Library

Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six

Yuehua Bu ; Ko-Wei Lih ; Weifan Wang

Access to full text
Full (PDF)

p. 429-439

The Polish Digital Mathematics Library

Defective choosability of graphs in surfaces

Douglas R. Woodall

Access to full text
Full (PDF)

p. 441-459

The Polish Digital Mathematics Library

The connected forcing connected vertex detour number of a graph

A.P. Santhakumaran ; P. Titus

Access to full text
Full (PDF)

p. 461-473

The Polish Digital Mathematics Library

Bounding neighbor-connectivity of Abelian Cayley graphs

Lynne L. Doty

Access to full text
Full (PDF)

p. 475-491

The Polish Digital Mathematics Library

The hull number of strong product graphs

A.P. Santhakumaran ; S.V. Ullas Chandran

Access to full text
Full (PDF)

p. 493-507

The Polish Digital Mathematics Library

An inductive proof of Whitney's Broken Circuit Theorem

Klaus Dohmen

Access to full text
Full (PDF)

p. 509-515

The Polish Digital Mathematics Library

γ-graphs of graphs

Gerd H. Fricke ; Sandra M. Hedetniemi ; Stephen T. Hedetniemi ; Kevin R. Hutson

Access to full text
Full (PDF)

p. 517-531

The Polish Digital Mathematics Library

Closed k-stop distance in graphs

Grady Bullington ; Linda Eroh ; Ralucca Gera ; Steven J. Winters

Access to full text
Full (PDF)

p. 533-545

The Polish Digital Mathematics Library

Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle

Laura Frigerio ; Federico Lastaria ; Norma Zagaglia Salvi

Access to full text
Full (PDF)

p. 547-557

The Polish Digital Mathematics Library

Unique factorization theorem for object-systems

Peter Mihók ; Gabriel Semanišin

Access to full text
Full (PDF)

p. 559-575

The Polish Digital Mathematics Library

Simplicial and nonsimplicial complete subgraphs

Terry A. McKee

Access to full text
Full (PDF)

p. 577-586

The Polish Digital Mathematics Library

On the strong parity chromatic number

Július Czap ; Stanislav Jendroľ ; František Kardoš

Access to full text
Full (PDF)

p. 587-600

The Polish Digital Mathematics Library

Forbidden-minor characterization for the class of cographic element splitting matroids

Kiran Dalvi ; Y.M. Borse ; M.M. Shikare

Access to full text
Full (PDF)

p. 601-606

The Polish Digital Mathematics Library

On the forcing geodetic and forcing steiner numbers of a graph

A.P. Santhakumaran ; J. John

Access to full text
Full (PDF)

p. 611-624

The Polish Digital Mathematics Library

Some results on semi-total signed graphs

Deepa Sinha ; Pravin Garg

Access to full text
Full (PDF)

p. 625-638

The Polish Digital Mathematics Library

Complete minors, independent sets, and chordal graphs

József Balogh ; John Lenz ; Hehui Wu

Access to full text
Full (PDF)

p. 639-674

The Polish Digital Mathematics Library

Oriented colouring of some graph products

N.R. Aravind ; N. Narayanan ; C.R. Subramanian

Access to full text
Full (PDF)

p. 675-686

The Polish Digital Mathematics Library

Characterization of trees with equal 2-domination number and domination number plus two

Mustapha Chellali ; Lutz Volkmann

Access to full text
Full (PDF)

p. 687-697

The Polish Digital Mathematics Library

Connected global offensive k-alliances in graphs

Lutz Volkmann

Access to full text
Full (PDF)

p. 699-707

The Polish Digital Mathematics Library

Upper bounds on the b-chromatic number and results for restricted graph classes

Mais Alkhateeb ; Anja Kohl

Access to full text
Full (PDF)

p. 709-735

The Polish Digital Mathematics Library

Wiener index of the tensor product of a path and a cycle

K. Pattabiraman ; P. Paulraja

Access to full text
Full (PDF)

p. 737-751

The Polish Digital Mathematics Library

Spanning tree congestion of rook's graphs

Kyohei Kozawa ; Yota Otachi

Access to full text
Full (PDF)

p. 753-761

The Polish Digital Mathematics Library

Roman bondage in graphs

Nader Jafari Rad ; Lutz Volkmann

Access to full text
Full (PDF)

p. 763-773

The Polish Digital Mathematics Library

Planar graphs without 4-, 5- and 8-cycles are 3-colorable

Sakib A. Mondal

Access to full text
Full (PDF)

p. 775-789

The Polish Digital Mathematics Library

On monochromatic paths and bicolored subdigraphs in arc-colored tournaments

Pietra Delgado-Escalante ; Hortensia Galeana-Sánchez

Access to full text
Full (PDF)

p. 791-820

The Polish Digital Mathematics Library

Table of contents