bwmeta1.element.issn-2083-5892, Volume 32 (2012)

Independent transversal domination in graphs

Ismail Sahul Hamid

Access to full text
Full (PDF)

p. 5-17

The Polish Digital Mathematics Library

Median of a graph with respect to edges

A.P. Santhakumaran

Access to full text
Full (PDF)

p. 19-29

The Polish Digital Mathematics Library

List coloring of complete multipartite graphs

Tomáš Vetrík

Access to full text
Full (PDF)

p. 31-37

The Polish Digital Mathematics Library

On total vertex irregularity strength of graphs

K. Muthu Guru Packiam ; Kumarappan Kathiresan

Access to full text
Full (PDF)

p. 39-45

The Polish Digital Mathematics Library

Embeddings of hamiltonian paths in faulty k-ary 2-cubes

Shiying Wang ; Shurong Zhang

Access to full text
Full (PDF)

p. 47-61

The Polish Digital Mathematics Library

Vertex rainbow colorings of graphs

Futaba Fujie-Okamoto ; Kyle Kolasinski ; Jianwei Lin ; Ping Zhang

Access to full text
Full (PDF)

p. 63-80

The Polish Digital Mathematics Library

Recognizable colorings of cycles and trees

Michael J. Dorfling ; Samantha Dorfling

Access to full text
Full (PDF)

p. 81-90

The Polish Digital Mathematics Library

The projective plane crossing number of the circulant graph C(3k;{1,k})

Pak Tung Ho

Access to full text
Full (PDF)

p. 91-108

The Polish Digital Mathematics Library

Double geodetic number of a graph

A.P. Santhakumaran ; T. Jebaraj

Access to full text
Full (PDF)

p. 109-119

The Polish Digital Mathematics Library

p-Wiener intervals and p-Wiener free intervals

Kumarappan Kathiresan ; S. Arockiaraj

Access to full text
Full (PDF)

p. 121-127

The Polish Digital Mathematics Library

The k-rainbow domatic number of a graph

Seyyed Mahmoud Sheikholeslami ; Lutz Volkmann

Access to full text
Full (PDF)

p. 129-140

The Polish Digital Mathematics Library

2-distance 4-colorability of planar subcubic graphs with girth at least 22

Oleg V. Borodin ; Anna O. Ivanova

Access to full text
Full (PDF)

p. 141-151

The Polish Digital Mathematics Library

On a generalization of the friendship theorem

Mohammad Hailat

Access to full text
Full (PDF)

p. 153-160

The Polish Digital Mathematics Library

Characterizing Cartesian fixers and multipliers

Stephen Benecke ; Christina M. Mynhardt

Access to full text
Full (PDF)

p. 161-175

The Polish Digital Mathematics Library

Parity vertex colorings of binomial trees

Petr Gregor ; Riste Škrekovski

Access to full text
Full (PDF)

p. 177-180

The Polish Digital Mathematics Library

The first player wins the one-colour triangle avoidance game on 16 vertices

Przemysław Gordinowicz ; Paweł Prałat

Access to full text
Full (PDF)

p. 181-185

The Polish Digital Mathematics Library

The vertex monophonic number of a graph

A.P. Santhakumaran ; P. Titus

Access to full text
Full (PDF)

p. 191-204

The Polish Digital Mathematics Library

3-transitive digraphs

César Hernández-Cruz

Access to full text
Full (PDF)

p. 205-219

The Polish Digital Mathematics Library

Disjoint 5-cycles in a graph

Hong Wang

Access to full text
Full (PDF)

p. 221-242

The Polish Digital Mathematics Library

A characterization of complete tripartite degree-magic graphs

Ľudmila Bezegová ; Jaroslav Ivančo

Access to full text
Full (PDF)

p. 243-253

The Polish Digital Mathematics Library

The Laplacian spectrum of some digraphs obtained from the wheel

Li Su ; Hong-Hai Li ; Liu-Rong Zheng

Access to full text
Full (PDF)

p. 255-261

The Polish Digital Mathematics Library

Trees with equal 2-domination and 2-independence numbers

Mustapha Chellali ; Nacéra Meddah

Access to full text
Full (PDF)

p. 263-270

The Polish Digital Mathematics Library

Edge maximal

C_{2 k + 1}

-edge disjoint free graphs

M.S.A. Bataineh ; M.M.M. Jaradat

Access to full text
Full (PDF)

p. 271-278

The Polish Digital Mathematics Library

On kaleidoscopic pseudo-randomness of finite Euclidean graphs

Le Anh Vinh

Access to full text
Full (PDF)

p. 279-287

The Polish Digital Mathematics Library

1-factors and characterization of reducible faces of plane elementary bipartite graphs

Andrej Taranenko ; Aleksander Vesel

Access to full text
Full (PDF)

p. 289-297

The Polish Digital Mathematics Library

Domination in functigraphs

Linda Eroh ; Ralucca Gera ; Cong X. Kang ; Craig E. Larson ; Eunjeong Yi

Access to full text
Full (PDF)

p. 299-319

The Polish Digital Mathematics Library

The vertex detour hull number of a graph

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

Access to full text
Full (PDF)

p. 321-330

The Polish Digital Mathematics Library

On Ramsey

(K_{1, 2}, K ₙ)

-minimal graphs

Mariusz Hałuszczak

Access to full text
Full (PDF)

p. 331-339

The Polish Digital Mathematics Library

Intersection graph of gamma sets in the total graph

T. Tamizh Chelvam ; T. Asir

Access to full text
Full (PDF)

p. 341-356

The Polish Digital Mathematics Library

Decompositions of a complete multidigraph into almost arbitrary paths

Mariusz Meszka ; Zdzisław Skupień

Access to full text
Full (PDF)

p. 357-372

The Polish Digital Mathematics Library

Edge cycle extendable graphs

Terry A. McKee

Access to full text
Full (PDF)

p. 373-378

The Polish Digital Mathematics Library

Erdös-Ko-Rado from intersecting shadows

Gyula O.H. Katona ; Ákos Kisvölcsey

Access to full text
Full (PDF)

p. 379-382

The Polish Digital Mathematics Library

Stable sets for

(P ₆, K_{2, 3})

-free graphs

Raffaele Mosca

Access to full text
Full (PDF)

p. 387-401

The Polish Digital Mathematics Library

Iterated neighborhood graphs

Martin Sonntag ; Hanns-Martin Teichert

Access to full text
Full (PDF)

p. 403-417

The Polish Digital Mathematics Library

On the total k-domination number of graphs

Adel P. Kazemi

Access to full text
Full (PDF)

p. 419-426

The Polish Digital Mathematics Library

Total vertex irregularity strength of disjoint union of Helm graphs

Ali Ahmad ; E.T. Baskoro ; M. Imran

Access to full text
Full (PDF)

p. 427-434

The Polish Digital Mathematics Library

Total domination versus paired domination

Oliver Schaudt

Access to full text
Full (PDF)

p. 435-447

The Polish Digital Mathematics Library

Fractional distance domination in graphs

S. Arumugam ; Varughese Mathew ; K. Karuppasamy

Access to full text
Full (PDF)

p. 449-459

The Polish Digital Mathematics Library

The total {k}-domatic number of digraphs

Seyed Mahmoud Sheikholeslami ; Lutz Volkmann

Access to full text
Full (PDF)

p. 461-471

The Polish Digital Mathematics Library

Paired- and induced paired-domination in {E,net}-free graphs

Oliver Schaudt

Access to full text
Full (PDF)

p. 473-485

The Polish Digital Mathematics Library

Nowhere-zero modular edge-graceful graphs

Ryan Jones ; Ping Zhang

Access to full text
Full (PDF)

p. 487-505

The Polish Digital Mathematics Library

On composition of signed graphs

K. Shahul Hameed ; K.A. Germina

Access to full text
Full (PDF)

p. 507-516

The Polish Digital Mathematics Library

Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs

Éric Sopena

Access to full text
Full (PDF)

p. 517-533

The Polish Digital Mathematics Library

On super (a,d)-edge antimagic total labeling of certain families of graphs

P. Roushini Leely Pushpam ; A. Saibulla

Access to full text
Full (PDF)

p. 535-543

The Polish Digital Mathematics Library

Light edges in 1-planar graphs with prescribed minimum degree

Dávid Hudák ; Peter Šugerek

Access to full text
Full (PDF)

p. 545-556

The Polish Digital Mathematics Library

Generalized graph cordiality

Oliver Pechenik ; Jennifer Wise

Access to full text
Full (PDF)

p. 557-567

The Polish Digital Mathematics Library

Generalizations of the tree packing conjecture

Dániel Gerbner ; Balázs Keszegh ; Cory Palmer

Access to full text
Full (PDF)

p. 569-582

The Polish Digital Mathematics Library

Generalized matrix graphs and completely independent critical cliques in any dimension

John J. Lattanzio ; Quan Zheng

Access to full text
Full (PDF)

p. 583-602

The Polish Digital Mathematics Library

The i-chords of cycles and paths

Terry A. McKee

Access to full text
Full (PDF)

p. 607-615

The Polish Digital Mathematics Library

4-chromatic Koester graphs

Andrey A. Dobrynin ; Leonid S. Mel'nikov

Access to full text
Full (PDF)

p. 617-627

The Polish Digital Mathematics Library

On the total restrained domination number of direct products of graphs

Wai Chee Shiu ; Hong-Yu Chen ; Xue-Gang Chen ; Pak Kiu Sun

Access to full text
Full (PDF)

p. 629-641

The Polish Digital Mathematics Library

Double domination critical and stable graphs upon vertex removal

Soufiane Khelifi ; Mustapha Chellali

Access to full text
Full (PDF)

p. 643-657

The Polish Digital Mathematics Library

Structural results on maximal k-degenerate graphs

Allan Bickle

Access to full text
Full (PDF)

p. 659-676

The Polish Digital Mathematics Library

On the dominator colorings in trees

Houcine Boumediene Merouane ; Mustapha Chellali

Access to full text
Full (PDF)

p. 677-683

The Polish Digital Mathematics Library

Minimal trees and monophonic convexity

Jose Cáceres ; Ortrud R. Oellermann ; M. L. Puertas

Access to full text
Full (PDF)

p. 685-704

The Polish Digital Mathematics Library

Hamiltonian-colored powers of strong digraphs

Garry Johns ; Ryan Jones ; Kyle Kolasinski ; Ping Zhang

Access to full text
Full (PDF)

p. 705-724

The Polish Digital Mathematics Library

Minimal rankings of the Cartesian product Kₙ ☐ Kₘ

Gilbert Eyabi ; Jobby Jacob ; Renu C. Laskar ; Darren A. Narayan ; Dan Pillone

Access to full text
Full (PDF)

p. 725-735

The Polish Digital Mathematics Library

On properties of maximal 1-planar graphs

Dávid Hudák ; Tomáš Madaras ; Yusuke Suzuki

Access to full text
Full (PDF)

p. 737-747

The Polish Digital Mathematics Library

Wiener and vertex PI indices of the strong product of graphs

K. Pattabiraman ; P. Paulraja

Access to full text
Full (PDF)

p. 749-769

The Polish Digital Mathematics Library

Sharp bounds for the number of matchings in generalized-theta-graphs

Ardeshir Dolati ; Somayyeh Golalizadeh

Access to full text
Full (PDF)

p. 771-782

The Polish Digital Mathematics Library

On the rainbow connection of Cartesian products and their subgraphs

Sandi Klavžar ; Gašper Mekiš

Access to full text
Full (PDF)

p. 783-793

The Polish Digital Mathematics Library

The s-packing chromatic number of a graph

Wayne Goddard ; Honghai Xu

Access to full text
Full (PDF)

p. 795-806

The Polish Digital Mathematics Library

Convex universal fixers

Magdalena Lemańska ; Rita Zuazua

Access to full text
Full (PDF)

p. 807-812

The Polish Digital Mathematics Library

Table of contents