bwmeta1.element.issn-2083-5892, Tome 30 (2010)

Sommaire

Value sets of graphs edge-weighted with elements of a finite abelian group

Edgar G. DuCasse ; Michael L. Gargano ; Louis V. Quintas

Access to full text
Full (PDF)

p. 5-15

The Polish Digital Mathematics Library

The periphery graph of a median graph

Boštjan Brešar ; Manoj Changat ; Ajitha R. Subhamathi ; Aleksandra Tepeh

Access to full text
Full (PDF)

p. 17-32

The Polish Digital Mathematics Library

Fractional global domination in graphs

Subramanian Arumugam ; Kalimuthu Karuppasamy ; Ismail Sahul Hamid

Access to full text
Full (PDF)

p. 33-44

The Polish Digital Mathematics Library

γ-labelings of complete bipartite graphs

Grady D. Bullington ; Linda L. Eroh ; Steven J. Winters

Access to full text
Full (PDF)

p. 45-54

The Polish Digital Mathematics Library

The edge geodetic number and Cartesian product of graphs

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

Access to full text
Full (PDF)

p. 55-73

The Polish Digital Mathematics Library

Further results on radial graphs

Kumarappan Kathiresan ; G. Marimuthu

Access to full text
Full (PDF)

p. 75-83

The Polish Digital Mathematics Library

The signless Laplacian spectral radius of graphs with given number of cut vertices

Lin Cui ; Yi-Zheng Fan

Access to full text
Full (PDF)

p. 85-93

The Polish Digital Mathematics Library

Vertex-distinguishing edge-colorings of linear forests

Sylwia Cichacz ; Jakub Przybyło

Access to full text
Full (PDF)

p. 95-103

The Polish Digital Mathematics Library

On characterization of uniquely 3-list colorable complete multipartite graphs

Yancai Zhao ; Erfang Shan

Access to full text
Full (PDF)

p. 105-114

The Polish Digital Mathematics Library

A note on cyclic chromatic number

Jana Zlámalová

Access to full text
Full (PDF)

p. 115-122

The Polish Digital Mathematics Library

Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4

Mahdieh Hasheminezhad ; Brendan D. McKay

Access to full text
Full (PDF)

p. 123-136

The Polish Digital Mathematics Library

On multiset colorings of graphs

Futaba Okamoto ; Ebrahim Salehi ; Ping Zhang

Access to full text
Full (PDF)

p. 137-153

The Polish Digital Mathematics Library

On edge detour graphs

A.P. Santhakumaran ; S. Athisayanathan

Access to full text
Full (PDF)

p. 155-174

The Polish Digital Mathematics Library

A conjecture on the prevalence of cubic bridge graphs

Jerzy A. Filar ; Michael Haythorpe ; Giang T. Nguyen

Access to full text
Full (PDF)

p. 175-179

The Polish Digital Mathematics Library

On the (2,2)-domination number of trees

You Lu ; Xinmin Hou ; Jun-Ming Xu

Access to full text
Full (PDF)

p. 185-199

The Polish Digital Mathematics Library

Radio number for some thorn graphs

Ruxandra Marinescu-Ghemeci

Access to full text
Full (PDF)

p. 201-222

The Polish Digital Mathematics Library

On locating-domination in graphs

Mustapha Chellali ; Malika Mimouni ; Peter J. Slater

Access to full text
Full (PDF)

p. 223-235

The Polish Digital Mathematics Library

On choosability of complete multipartite graphs

K_{4, 3 * t, 2 * (k - 2 t - 2), 1 * (t + 1)}

Guo-Ping Zheng ; Yu-Fa Shen ; Zuo-Li Chen ; Jin-Feng Lv

Access to full text
Full (PDF)

p. 237-244

The Polish Digital Mathematics Library

Chvátal-Erdös type theorems

Jill R. Faudree ; Ralph J. Faudree ; Ronald J. Gould ; Michael S. Jacobson ; Colton Magnant

Access to full text
Full (PDF)

p. 245-256

The Polish Digital Mathematics Library

Graph centers used for stabilization of matrix factorizations

Pavla Kabelíková

Access to full text
Full (PDF)

p. 249-259

The Polish Digital Mathematics Library

Nordhaus-Gaddum results for weakly convex domination number of a graph

Magdalena Lemańska

Access to full text
Full (PDF)

p. 257-263

The Polish Digital Mathematics Library

k-independence stable graphs upon edge removal

Mustapha Chellali ; Teresa W. Haynes ; Lutz Volkmann

Access to full text
Full (PDF)

p. 265-274

The Polish Digital Mathematics Library

17th workshop '3in1' 2008

A. Paweł Wojda

Access to full text
Full (PDF)

p. 275-276

The Polish Digital Mathematics Library

Random procedures for dominating sets in bipartite graphs

Sarah Artmann ; Jochen Harant

Access to full text
Full (PDF)

p. 277-288

The Polish Digital Mathematics Library

On a family of cubic graphs containing the flower snarks

Jean-Luc Fouquet ; Henri Thuillier ; Jean-Marie Vanherpe

Access to full text
Full (PDF)

p. 289-314

The Polish Digital Mathematics Library

Mácajová and Škoviera conjecture on cubic graphs

Jean-Luc Fouquet ; Jean-Marie Vanherpe

Access to full text
Full (PDF)

p. 315-333

The Polish Digital Mathematics Library

Decompositions of multigraphs into parts with the same size

Jaroslav Ivanco

Access to full text
Full (PDF)

p. 335-347

The Polish Digital Mathematics Library

The edge C₄ graph of some graph classes

Manju K. Menon ; A. Vijayakumar

Access to full text
Full (PDF)

p. 365-375

The Polish Digital Mathematics Library

Total outer-connected domination in trees

Joanna Cyman

Access to full text
Full (PDF)

p. 377-383

The Polish Digital Mathematics Library

Fall coloring of graphs I

Rangaswami Balakrishnan ; T. Kavaskar

Access to full text
Full (PDF)

p. 385-391

The Polish Digital Mathematics Library

3-consecutive c-colorings of graphs

Csilla Bujtás ; E. Sampathkumar ; Zsolt Tuza ; M.S. Subramanya ; Charles Dominic

Access to full text
Full (PDF)

p. 393-405

The Polish Digital Mathematics Library

Structure of the set of all minimal total dominating functions of some classes of graphs

K. Reji Kumar ; Gary MacGillivray

Access to full text
Full (PDF)

p. 407-423

The Polish Digital Mathematics Library

A characterization of (γₜ,γ₂)-trees

You Lu ; Xinmin Hou ; Jun-Ming Xu ; Ning Li

Access to full text
Full (PDF)

p. 425-435

The Polish Digital Mathematics Library

Graphs for n-circular matroids

Renata Kawa

Access to full text
Full (PDF)

p. 437-447

The Polish Digital Mathematics Library

The competition numbers of Johnson graphs

Suh-Ryung Kim ; Boram Park ; Yoshio Sano

Access to full text
Full (PDF)

p. 449-459

The Polish Digital Mathematics Library

Factoring directed graphs with respect to the cardinal product in polynomial time II

Wilfried Imrich ; Werner Klöckl

Access to full text
Full (PDF)

p. 461-474

The Polish Digital Mathematics Library

Lower bounds for the domination number

Ermelinda Delaviña ; Ryan Pepper ; Bill Waller

Access to full text
Full (PDF)

p. 475-487

The Polish Digital Mathematics Library

The Wiener number of powers of the Mycielskian

Rangaswami Balakrishnan ; S. Francis Raj

Access to full text
Full (PDF)

p. 489-498

The Polish Digital Mathematics Library

Colouring game and generalized colouring game on graphs with cut-vertices

Elżbieta Sidorowicz

Access to full text
Full (PDF)

p. 499-533

The Polish Digital Mathematics Library

Arithmetic labelings and geometric labelings of countable graphs

Gurusamy Rengasamy Vijayakumar

Access to full text
Full (PDF)

p. 539-544

The Polish Digital Mathematics Library

Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs

Hortensia Galeana-Sánchez ; R. Rojas-Monroy ; B. Zavala

Access to full text
Full (PDF)

p. 545-553

The Polish Digital Mathematics Library

Rainbow numbers for small stars with one edge added

Izolda Gorgol ; Ewa Łazuka

Access to full text
Full (PDF)

p. 555-562

The Polish Digital Mathematics Library

Partitioning a graph into a dominating set, a total dominating set, and something else

Michael A. Henning ; Christian Löwenstein ; Dieter Rautenbach

Access to full text
Full (PDF)

p. 563-574

The Polish Digital Mathematics Library

Cancellation of direct products of digraphs

Richard H. Hammack ; Katherine E. Toman

Access to full text
Full (PDF)

p. 575-590

The Polish Digital Mathematics Library

On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph

David Auger ; Irène Charon ; Olivier Hudry ; Antoine Lobstein

Access to full text
Full (PDF)

p. 591-609

The Polish Digital Mathematics Library

Matchings and total domination subdivision number in graphs with few induced 4-cycles

Odile Favaron ; Hossein Karami ; Rana Khoeilar ; Seyed Mahmoud Sheikholeslami

Access to full text
Full (PDF)

p. 611-618

The Polish Digital Mathematics Library

Vertex coloring the square of outerplanar graphs of low degree

Geir Agnarsson ; Magnús M. Halldórsson

Access to full text
Full (PDF)

p. 619-636

The Polish Digital Mathematics Library

On Ramsey

(K_{1, 2}, C ₄)

-minimal graphs

Tomás Vetrík ; Lyra Yulianti ; Edy Tri Baskoro

Access to full text
Full (PDF)

p. 637-649

The Polish Digital Mathematics Library

Clique graph representations of ptolemaic graphs

Terry A. Mckee

Access to full text
Full (PDF)

p. 651-661

The Polish Digital Mathematics Library

On vertex stability with regard to complete bipartite subgraphs

Aneta Dudek ; Andrzej Żak

Access to full text
Full (PDF)

p. 663-669

The Polish Digital Mathematics Library

n-ary transit functions in graphs

Manoj Changat ; Joseph Mathews ; Iztok Peterin ; Prasanth G. Narasimha-Shenoi

Access to full text
Full (PDF)

p. 671-685

The Polish Digital Mathematics Library

The geodetic number of strong product graphs

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

Access to full text
Full (PDF)

p. 687-700

The Polish Digital Mathematics Library

A note on Hamiltonian cycles in generalized Halin graphs

Magdalena Bojarska

Access to full text
Full (PDF)

p. 701-704

The Polish Digital Mathematics Library

The NP-completeness of automorphic colorings

Giuseppe Mazzuoccolo

Access to full text
Full (PDF)

p. 705-710

The Polish Digital Mathematics Library