bwmeta1.element.issn-2083-5892, Tome 33 (2013)

Sommaire

Preface

Ewa Drgas-Burchardt ; Mariusz Hałuszczak ; Maria Kwaśnik ; Danuta Michalak ; Elżbieta Sidorowicz

Access to full text
Full (PDF)

p. 5-6

The Polish Digital Mathematics Library

Hereditarnia

Izak Broere ; Peter Mihók

Access to full text
Full (PDF)

p. 7

The Polish Digital Mathematics Library

On the Non-(p−1)-Partite Kp-Free Graphs

Kinnari Amin ; Jill Faudree ; Ronald J. Gould ; Elżbieta Sidorowicz

Access to full text
Full (PDF)

p. 9-23

The Polish Digital Mathematics Library

Coloring Some Finite Sets in ℝn

József Balogh ; Alexandr Kostochka ; Andrei Raigorodskii

Access to full text
Full (PDF)

p. 25-31

The Polish Digital Mathematics Library

Universality for and in Induced-Hereditary Graph Properties

Izak Broere ; Johannes Heidema

Access to full text
Full (PDF)

p. 33-47

The Polish Digital Mathematics Library

A Note on the Uniqueness of Stable Marriage Matching

Ewa Drgas-Burchardt

Access to full text
Full (PDF)

p. 49-55

The Polish Digital Mathematics Library

When is an Incomplete 3 × n Latin Rectangle Completable?

Reinhardt Euler ; Paweł Oleksik

Access to full text
Full (PDF)

p. 57-69

The Polish Digital Mathematics Library

On Vertices Enforcing a Hamiltonian Cycle

Igor Fabrici ; Erhard Hexel ; Stanislav Jendrol’

Access to full text
Full (PDF)

p. 71-89

The Polish Digital Mathematics Library

Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree

Anna Fiedorowicz

Access to full text
Full (PDF)

p. 91-99

The Polish Digital Mathematics Library

On Minimum (Kq, K) Stable Graphs

J.L. Fouquet ; H. Thuillier ; J.M. Vanherpe ; A.P. Wojda

Access to full text
Full (PDF)

p. 101-115

The Polish Digital Mathematics Library

A Survey of the Path Partition Conjecture

Marietjie Frick

Access to full text
Full (PDF)

p. 117-131

The Polish Digital Mathematics Library

A Note on Barnette’s Conjecture

Jochen Harant

Access to full text
Full (PDF)

p. 133-137

The Polish Digital Mathematics Library

On Graphs with Disjoint Dominating and 2-Dominating Sets

Michael A. Henning ; Douglas F. Rall

Access to full text
Full (PDF)

p. 139-146

The Polish Digital Mathematics Library

On Maximum Weight of a Bipartite Graph of Given Order and Size

Mirko Horňák ; Stanislav Jendrol’ ; Ingo Schiermeyer

Access to full text
Full (PDF)

p. 147-165

The Polish Digital Mathematics Library

Fractional (P,Q)-Total List Colorings of Graphs

Arnfried Kemnitz ; Peter Mihók ; Margit Voigt

Access to full text
Full (PDF)

p. 167-179

The Polish Digital Mathematics Library

Rainbow Connection In Sparse Graphs

Arnfried Kemnitz ; Jakub Przybyło ; Ingo Schiermeyer ; Mariusz Woźniak

Access to full text
Full (PDF)

p. 181-192

The Polish Digital Mathematics Library

A Note on Uniquely Embeddable Forests

Justyna Otfinowska ; Mariusz Woźniak

Access to full text
Full (PDF)

p. 193-201

The Polish Digital Mathematics Library

Distance-Locally Disconnected Graphs

Mirka Miller ; Joe Ryan ; Zdeněk Ryjáček

Access to full text
Full (PDF)

p. 203-215

The Polish Digital Mathematics Library

Sums of Powered Characteristic Roots Count Distance-Independent Circular Sets

Zdzisław Skupień

Access to full text
Full (PDF)

p. 217-229

The Polish Digital Mathematics Library

Choice-Perfect Graphs

Zsolt Tuza

Access to full text
Full (PDF)

p. 231-242

The Polish Digital Mathematics Library

4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs

César Hernández-Cruz

Access to full text
Full (PDF)

p. 247-260

The Polish Digital Mathematics Library

Independent Detour Transversals in 3-Deficient Digraphs

Susan van Aardt ; Marietjie Frick ; Joy Singleton

Access to full text
Full (PDF)

p. 261-275

The Polish Digital Mathematics Library

Exact Expectation and Variance of Minimal Basis of Random Matroids

Wojciech Kordecki ; Anna Lyczkowska-Hanćkowiak

Access to full text
Full (PDF)

p. 277-288

The Polish Digital Mathematics Library

Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)

Xiang’en Chen ; Yuping Gao ; Bing Yao

Access to full text
Full (PDF)

p. 289-306

The Polish Digital Mathematics Library

On the Rainbow Vertex-Connection

Xueliang Li ; Yongtang Shi

Access to full text
Full (PDF)

p. 307-313

The Polish Digital Mathematics Library

The Incidence Chromatic Number of Toroidal Grids

Éric Sopena ; Jiaojiao Wu

Access to full text
Full (PDF)

p. 315-327

The Polish Digital Mathematics Library

Frucht’s Theorem for the Digraph Factorial

Richard H. Hammack

Access to full text
Full (PDF)

p. 329-336

The Polish Digital Mathematics Library

Strong Equality Between the Roman Domination and Independent Roman Domination Numbers in Trees

Mustapha Chellali ; Nader Jafari Rad

Access to full text
Full (PDF)

p. 337-346

The Polish Digital Mathematics Library

The Balanced Decomposition Number of TK4 and Series-Parallel Graphs

Shinya Fujita ; Henry Liu

Access to full text
Full (PDF)

p. 347-359

The Polish Digital Mathematics Library

On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers

H.P. Patil ; R. Pandiya Raj

Access to full text
Full (PDF)

p. 361-371

The Polish Digital Mathematics Library

Star Coloring of Subcubic Graphs

T. Karthick ; C.R. Subramanian

Access to full text
Full (PDF)

p. 373-385

The Polish Digital Mathematics Library

On the Domination of Cartesian Product of Directed Cycles: Results for Certain Equivalence Classes of Lengths

Michel Mollard

Access to full text
Full (PDF)

p. 387-394

The Polish Digital Mathematics Library

A Characterization of Trees for a New Lower Bound on the K-Independence Number

Nacéra Meddah ; Mostafa Blidia

Access to full text
Full (PDF)

p. 395-410

The Polish Digital Mathematics Library

On Closed Modular Colorings of Trees

Bryan Phinezy ; Ping Zhang

Access to full text
Full (PDF)

p. 411-428

The Polish Digital Mathematics Library

Underlying Graphs of 3-Quasi-Transitive Digraphs and 3-Transitive Digraphs

Ruixia Wang ; Shiying Wang

Access to full text
Full (PDF)

p. 429-435

The Polish Digital Mathematics Library

Edge Dominating Sets and Vertex Covers

Ronald Dutton ; William F. Klostermeyer

Access to full text
Full (PDF)

p. 437-456

The Polish Digital Mathematics Library

Two Short Proofs on Total Domination

Allan Bickle

Access to full text
Full (PDF)

p. 457-459

The Polish Digital Mathematics Library

A Tight Bound on the Set Chromatic Number

Jean-Sébastien Sereni ; Zelealem B. Yilma

Access to full text
Full (PDF)

p. 461-465

The Polish Digital Mathematics Library

The Path-Distance-Width of Hypercubes

Yota Otachi

Access to full text
Full (PDF)

p. 467-470

The Polish Digital Mathematics Library

Preface

Access to full text
Full (PDF)

p. 475

The Polish Digital Mathematics Library

Universality in Graph Properties with Degree Restrictions

Izak Broere ; Johannes Heidema ; Peter Mihók

Access to full text
Full (PDF)

p. 477-492

The Polish Digital Mathematics Library

γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs

Enrique Casas-Bautista ; Hortensia Galeana-Sánchez ; Rocío Rojas-Monroy

Access to full text
Full (PDF)

p. 493-507

The Polish Digital Mathematics Library

Fractional Q-Edge-Coloring of Graphs

Július Czap ; Peter Mihók

Access to full text
Full (PDF)

p. 509-519

The Polish Digital Mathematics Library

Decompositions of Plane Graphs Under Parity Constrains Given by Faces

Július Czap ; Zsolt Tuza

Access to full text
Full (PDF)

p. 521-530

The Polish Digital Mathematics Library

Counting Maximal Distance-Independent Sets in Grid Graphs

Reinhardt Euler ; Paweł Oleksik ; Zdzisław Skupień

Access to full text
Full (PDF)

p. 531-557

The Polish Digital Mathematics Library

Maximum Semi-Matching Problem in Bipartite Graphs

Ján Katrenič ; Gabriel Semanišin

Access to full text
Full (PDF)

p. 559-569

The Polish Digital Mathematics Library

The Crossing Numbers of Products of Path with Graphs of Order Six

Marián Klešč ; Jana Petrillová

Access to full text
Full (PDF)

p. 571-582

The Polish Digital Mathematics Library

On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six

Marián Klešč ; Štefan Schrötter

Access to full text
Full (PDF)

p. 583-597

The Polish Digital Mathematics Library

Broken Circuits in Matroids-Dohmen’s Inductive Proof

Wojciech Kordecki ; Anna Łyczkowska-Hanćkowiak

Access to full text
Full (PDF)

p. 599-602

The Polish Digital Mathematics Library

Rainbow Connection Number of Dense Graphs

Xueliang Li ; Mengmeng Liu ; Ingo Schiermeyer

Access to full text
Full (PDF)

p. 603-611

The Polish Digital Mathematics Library

Interval Edge-Colorings of Cartesian Products of Graphs I

Petros A. Petrosyan ; Hrant H. Khachatrian ; Hovhannes G. Tananyan

Access to full text
Full (PDF)

p. 613-632

The Polish Digital Mathematics Library

Characterizations of the Family of All Generalized Line Graphs-Finite and Infinite-and Classification of the Family of All Graphs Whose Least Eigenvalues ≥ −2

Gurusamy Rengasamy Vijayakumar

Access to full text
Full (PDF)

p. 637-648

The Polish Digital Mathematics Library

Some Sharp Bounds on the Negative Decision Number of Graphs

Hongyu Liang

Access to full text
Full (PDF)

p. 649-656

The Polish Digital Mathematics Library

The Phylogeny Graphs of Doubly Partial Orders

Boram Park ; Yoshio Sano

Access to full text
Full (PDF)

p. 657-664

The Polish Digital Mathematics Library

Generalized Fractional Total Colorings of Complete Graph

Gabriela Karafová

Access to full text
Full (PDF)

p. 665-676

The Polish Digital Mathematics Library

Weak Saturation Numbers for Sparse Graphs

Ralph J. Faudree ; Ronald J. Gould ; Michael S. Jacobson

Access to full text
Full (PDF)

p. 677-693

The Polish Digital Mathematics Library

Symmetric Hamilton Cycle Decompositions of Complete Multigraphs

V. Chitra ; A. Muthusamy

Access to full text
Full (PDF)

p. 695-707

The Polish Digital Mathematics Library

Bounds on the Signed 2-Independence Number in Graphs

Lutz Volkmann

Access to full text
Full (PDF)

p. 709-715

The Polish Digital Mathematics Library

The Distance Roman Domination Numbers of Graphs

Hamideh Aram ; Sepideh Norouzian ; Seyed Mahmoud Sheikholeslami

Access to full text
Full (PDF)

p. 717-730

The Polish Digital Mathematics Library

Path-Neighborhood Graphs

R.C. Laskar ; Henry Martyn Mulder

Access to full text
Full (PDF)

p. 731-745

The Polish Digital Mathematics Library

The B-Domatic Number of a Graph

Odile Favaron

Access to full text
Full (PDF)

p. 747-757

The Polish Digital Mathematics Library

Precise Upper Bound for the Strong Edge Chromatic Number of Sparse Planar Graphs

Oleg V. Borodin ; Anna O. Ivanova

Access to full text
Full (PDF)

p. 759-770

The Polish Digital Mathematics Library

Almost-Rainbow Edge-Colorings of Some Small Subgraphs

Elliot Krop ; Irina Krop

Access to full text
Full (PDF)

p. 771-784

The Polish Digital Mathematics Library

Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs

Jernej Azarija

Access to full text
Full (PDF)

p. 785-790

The Polish Digital Mathematics Library