bwmeta1.element.issn-2083-5892, Tome 37 (2017)

Sommaire

All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5

p. 5-12

The Polish Digital Mathematics Library

A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs

Yury Metelsky ; Kseniya Schemeleva ; Frank Werner

Access to full text
Full (PDF)

p. 13-28

The Polish Digital Mathematics Library

A Note on Neighbor Expanded Sum Distinguishing Index

Evelyne Flandrin ; Hao Li ; Antoni Marczyk ; Jean-François Saclé ; Mariusz Woźniak

Access to full text
Full (PDF)

p. 29-37

The Polish Digital Mathematics Library

Signed Roman Edgek-Domination in Graphs

Leila Asgharsharghi ; Seyed Mahmoud Sheikholeslami ; Lutz Volkmann

Access to full text
Full (PDF)

p. 39-53

The Polish Digital Mathematics Library

Decomposition of Certain Complete Bipartite Graphs into Prisms

Dalibor Froncek

Access to full text
Full (PDF)

p. 55-62

The Polish Digital Mathematics Library

Eternal Domination: Criticality and Reachability

William F. Klostermeyer ; Gary MacGillivray

Access to full text
Full (PDF)

p. 63-77

The Polish Digital Mathematics Library

On theH-Force Number of Hamiltonian Graphs and Cycle Extendability

Erhard Hexel

Access to full text
Full (PDF)

p. 79-88

The Polish Digital Mathematics Library

Structural Properties of Recursively Partitionable Graphs with Connectivity 2

Olivier Baudon ; Julien Bensmail ; Florent Foucaud ; Monika Pilśniak

Access to full text
Full (PDF)

p. 89-115

The Polish Digital Mathematics Library

Some Results on 4-Transitive Digraphs

Patricio Ricardo García-Vázquez ; César Hernández-Cruz

Access to full text
Full (PDF)

p. 117-129

The Polish Digital Mathematics Library

Almost Self-Complementary 3-Uniform Hypergraphs

Lata N. Kamble ; Charusheela M. Deshpande ; Bhagyashree Y. Bam

Access to full text
Full (PDF)

p. 131-140

The Polish Digital Mathematics Library

Rainbow Connection Number of Graphs with Diameter 3

Hengzhe Li ; Xueliang Li ; Yuefang Sun

Access to full text
Full (PDF)

p. 141-154

The Polish Digital Mathematics Library

Distinguishing Cartesian Products of Countable Graphs

Ehsan Estaji ; Wilfried Imrich ; Rafał Kalinowski ; Monika Pilśniak ; Thomas Tucker

Access to full text
Full (PDF)

p. 155-164

The Polish Digital Mathematics Library

The list Distinguishing Number Equals the Distinguishing Number for Interval Graphs

Poppy Immel ; Paul S. Wenger

Access to full text
Full (PDF)

p. 165-174

The Polish Digital Mathematics Library

Criticality of Switching Classes of Reversible 2-Structures Labeled by an Abelian Group

Houmem Belkhechine ; Pierre Ille ; Robert E. Woodrow

Access to full text
Full (PDF)

p. 175-209

The Polish Digital Mathematics Library

Onq-Power Cycles in Cubic Graphs

Julien Bensmail

Access to full text
Full (PDF)

p. 211-220

The Polish Digital Mathematics Library

The Dichromatic Number of Infinite Families of Circulant Tournaments

Nahid Javier ; Bernardo Llano

Access to full text
Full (PDF)

p. 221-238

The Polish Digital Mathematics Library

Union of Distance Magic Graphs

Sylwia Cichacz ; Mateusz Nikodem

Access to full text
Full (PDF)

p. 239-249

The Polish Digital Mathematics Library

A Constructive Extension of the Characterization on PotentiallyK s , t -Bigraphic Pairs

Ji-Yun Guo ; Jian-Hua Yin

Access to full text
Full (PDF)

p. 251-259

The Polish Digital Mathematics Library

Signed Total Roman Domination in Digraphs

Lutz Volkmann

Access to full text
Full (PDF)

p. 261-272

The Polish Digital Mathematics Library

Computing the Metric Dimension of a Graph from Primary Subgraphs

Dorota Kuziak ; Juan A. Rodríguez-Velázquez ; Ismael G. Yero

Access to full text
Full (PDF)

p. 273-293

The Polish Digital Mathematics Library

Preface

Ewa Drgas-Burchardt ; Elżbieta Sidorowicz

Access to full text
Full (PDF)

p. 299-300

The Polish Digital Mathematics Library

Rainbow Connectivity of Cacti and of Some Infinite Digraphs

Jesús Alva-Samos ; Juan José Montellano-Ballesteros

Access to full text
Full (PDF)

p. 301-313

The Polish Digital Mathematics Library

Forbidden Structures for Planar Perfect Consecutively Colourable Graphs

Marta Borowiecka-Olszewska ; Ewa Drgas-Burchardt

Access to full text
Full (PDF)

p. 315-336

The Polish Digital Mathematics Library

How Long Can One Bluff in the Domination Game?

Boštan Brešar ; Paul Dorbec ; Sandi Klavžar ; Gašpar Košmrlj

Access to full text
Full (PDF)

p. 337-352

The Polish Digital Mathematics Library

WORM Colorings of Planar Graphs

J. Czap ; S. Jendrol’ ; J. Valiska

Access to full text
Full (PDF)

p. 353-368

The Polish Digital Mathematics Library

Domination Game: Extremal Families for the 3/5-Conjecture for Forests

Michael A. Henning ; Christian Löwenstein

Access to full text
Full (PDF)

p. 369-381

The Polish Digital Mathematics Library

Distance 2-Domination in Prisms of Graphs

Ferran Hurtado ; Mercè Mora ; Eduardo Rivera-Campo ; Rita Zuazua

Access to full text
Full (PDF)

p. 383-397

The Polish Digital Mathematics Library

On the Crossing Numbers of Cartesian Products of Wheels and Trees

Marián Klešč ; Jana Petrillová ; Matúš Valo

Access to full text
Full (PDF)

p. 399-413

The Polish Digital Mathematics Library

On Sequential Heuristic Methods for the Maximum Independent Set Problem

Ngoc C. Lê ; Christoph Brause ; Ingo Schiermeyer

Access to full text
Full (PDF)

p. 415-426

The Polish Digital Mathematics Library

Interval Incidence Coloring of Subcubic Graphs

Anna Małafiejska ; Michał Małafiejski

Access to full text
Full (PDF)

p. 427-441

The Polish Digital Mathematics Library

One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three

Joanna Polcyn

Access to full text
Full (PDF)

p. 443-464

The Polish Digital Mathematics Library

The Chromatic Number of Random Intersection Graphs

Katarzyna Rybarczyk

Access to full text
Full (PDF)

p. 465-476

The Polish Digital Mathematics Library

A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs

Wojciech Wide

Access to full text
Full (PDF)

p. 477-499

The Polish Digital Mathematics Library

On the Laplacian Coefficients of Tricyclic Graphs with Prescribed Matching Number

Jing Luo ; Zhongxun Zhu ; Runze Wan

Access to full text
Full (PDF)

p. 505-522

The Polish Digital Mathematics Library

C7-Decompositions of the Tensor Product of Complete Graphs

R.S. Manikandan ; P. Paulraja

Access to full text
Full (PDF)

p. 523-535

The Polish Digital Mathematics Library

A Sufficient Condition for Graphs to Be SuperK-Restricted Edge Connected

Shiying Wang ; Meiyu Wang ; Lei Zhang

Access to full text
Full (PDF)

p. 537-545

The Polish Digital Mathematics Library

On Generalized Sierpiński Graphs

Juan Alberto Rodríguez-Velázquez ; Erick David Rodríguez-Bazan ; Alejandro Estrada-Moreno

Access to full text
Full (PDF)

p. 547-560

The Polish Digital Mathematics Library

The Thickness of Amalgamations and Cartesian Product of Graphs

Yan Yang ; Yichao Chen

Access to full text
Full (PDF)

p. 561-572

The Polish Digital Mathematics Library

Regularity and Planarity of Token Graphs

Walter Carballosa ; Ruy Fabila-Monroy ; Jesús Leaños ; Luis Manuel Rivera

Access to full text
Full (PDF)

p. 573-586

The Polish Digital Mathematics Library

Characterizing Atoms that Result from Decomposition by Clique Separators

Terry A. McKee

Access to full text
Full (PDF)

p. 587-594

The Polish Digital Mathematics Library

Construction of Cospectral Integral Regular Graphs

Ravindra B. Bapat ; Masoud Karimi

Access to full text
Full (PDF)

p. 595-609

The Polish Digital Mathematics Library

Characterization Results for theL(2, 1, 1)-Labeling Problem on Trees

Xiaoling Zhang ; Kecai Deng

Access to full text
Full (PDF)

p. 611-622

The Polish Digital Mathematics Library

On the Maximum and Minimum Sizes of a Graph with Givenk-Connectivity

Yuefang Sun

Access to full text
Full (PDF)

p. 623-632

The Polish Digital Mathematics Library

One-Three Join: A Graph Operation and Its Consequences

M.A. Shalu ; S. Devi Yamini

Access to full text
Full (PDF)

p. 633-647

The Polish Digital Mathematics Library

Forbidden Pairs and (k,m)-Pancyclicity

Charles Brian Crane

Access to full text
Full (PDF)

p. 649-663

The Polish Digital Mathematics Library

Packing Coloring of Some Undirected and Oriented Coronae Graphs

Daouya Laïche ; Isma Bouchemakh ; Éric Sopena

Access to full text
Full (PDF)

p. 665-690

The Polish Digital Mathematics Library

Heavy Subgraphs, Stability and Hamiltonicity

Binlong Li ; Bo Ning

Access to full text
Full (PDF)

p. 691-710

The Polish Digital Mathematics Library

Kaleidoscopic Colorings of Graphs

Gary Chartrand ; Sean English ; Ping Zhang

Access to full text
Full (PDF)

p. 711-727

The Polish Digital Mathematics Library

On the Spectral Characterizations of Graphs

Jing Huang ; Shuchao Li

Access to full text
Full (PDF)

p. 729-744

The Polish Digital Mathematics Library

A Note on the Locating-Total Domination in Graphs

Mirka Miller ; R. Sundara Rajan ; R. Jayagopal ; Indra Rajasingh ; Paul Manuel

Access to full text
Full (PDF)

p. 745-754

The Polish Digital Mathematics Library

Ramsey Properties of Random Graphs and Folkman Numbers

Vojtěch Rödl ; Andrzej Ruciński ; Mathias Schacht

Access to full text
Full (PDF)

p. 755-776

The Polish Digital Mathematics Library

Chromatic Properties of the Pancake Graphs

Elena Konstantinova

Access to full text
Full (PDF)

p. 777-787

The Polish Digital Mathematics Library

Asymptotic Sharpness of Bounds on Hypertrees

Yi Lin ; Liying Kang ; Erfang Shan

Access to full text
Full (PDF)

p. 789-795

The Polish Digital Mathematics Library

A Degree Condition Implying Ore-Type Condition for Even [2,b]-Factors in Graphs

Shoichi Tsuchiya ; Takamasa Yashima

Access to full text
Full (PDF)

p. 797-809

The Polish Digital Mathematics Library

Saturation Spectrum of Paths and Stars

Jill Faudree ; Ralph J. Faudree ; Ronald J. Gould ; Michael S. Jacobson ; Brent J. Thomas

Access to full text
Full (PDF)

p. 811-822

The Polish Digital Mathematics Library

The Degree-Diameter Problem for Outerplanar Graphs

Peter Dankelmann ; Elizabeth Jonck ; Tomáš Vetrík

Access to full text
Full (PDF)

p. 823-834

The Polish Digital Mathematics Library

On Double-Star Decomposition of Graphs

Saieed Akbari ; Shahab Haghi ; Hamidreza Maimani ; Abbas Seify

Access to full text
Full (PDF)

p. 835-840

The Polish Digital Mathematics Library

Strong Edge-Coloring Of Planar Graphs

Wen-Yao Song ; Lian-Ying Miao

Access to full text
Full (PDF)

p. 845-857

The Polish Digital Mathematics Library

On The Roman Domination Stable Graphs

Majid Hajian ; Nader Jafari Rad

Access to full text
Full (PDF)

p. 859-871

The Polish Digital Mathematics Library

Prime Factorization And Domination In The Hierarchical Product Of Graphs

S.E. Anderson ; Y. Guob ; A. Tenney ; K.A. Wash

Access to full text
Full (PDF)

p. 873-890

The Polish Digital Mathematics Library

Constant 2-Labellings And An Application To (R, A, B)-Covering Codes

Sylvain Gravier ; Èlise Vandomme

Access to full text
Full (PDF)

p. 891-918

The Polish Digital Mathematics Library

The Total Acquisition Number Of The Randomly Weighted Path

Anant Godbole ; Elizabeth Kelley ; Emily Kurtz ; Paweł Prałat ; Yiguang Zhang

Access to full text
Full (PDF)

p. 919-934

The Polish Digital Mathematics Library

Per-Spectral Characterizations Of Some Bipartite Graphs

Tingzeng Wu ; Heping Zhang

Access to full text
Full (PDF)

p. 935-951

The Polish Digital Mathematics Library

Relating 2-Rainbow Domination To Roman Domination

José D. Alvarado ; Simone Dantas ; Dieter Rautenbach

Access to full text
Full (PDF)

p. 953-961

The Polish Digital Mathematics Library

Every 8-Traceable Oriented Graph Is Traceable

Susan A. van Aardt

Access to full text
Full (PDF)

p. 963-973

The Polish Digital Mathematics Library

A Sharp Lower Bound For The Generalized 3-Edge-Connectivity Of Strong Product Graphs

Yuefang Sun

Access to full text
Full (PDF)

p. 975-988

The Polish Digital Mathematics Library

Twin Minus Total Domination Numbers In Directed Graphs

Nasrin Dehgardi ; Maryam Atapour

Access to full text
Full (PDF)

p. 989-1004

The Polish Digital Mathematics Library

Proper Connection Of Direct Products

Richard H. Hammack ; Dewey T. Taylor

Access to full text
Full (PDF)

p. 1005-1013

The Polish Digital Mathematics Library

Labeled Embedding Of (n, n-2)-Graphs In Their Complements

M.-A. Tahraoui ; E. Duchêne ; H. Kheddouci

Access to full text
Full (PDF)

p. 1015-1025

The Polish Digital Mathematics Library

The Signed Total Roman k-Domatic Number Of A Graph

Lutz Volkmann

Access to full text
Full (PDF)

p. 1027-1038

The Polish Digital Mathematics Library

Signed Total Roman Edge Domination In Graphs

Leila Asgharsharghi ; Seyed Mahmoud Sheikholeslami

Access to full text
Full (PDF)

p. 1039-1053

The Polish Digital Mathematics Library

The Existence Of P≥3-Factor Covered Graphs

Sizhong Zhou ; Jiancheng Wu ; Tao Zhang

Access to full text
Full (PDF)

p. 1055-1065

The Polish Digital Mathematics Library

On H-Irregularity Strength Of Graphs

Faraha Ashraf ; Martin Bača ; Marcela Lascśaková ; Andrea Semaničová-Feňovčíková

Access to full text
Full (PDF)

p. 1067-1078

The Polish Digital Mathematics Library

Equitable Colorings Of Corona Multiproducts Of Graphs

Hanna Furmánczyk ; Marek Kubale ; Vahan V. Mkrtchyan

Access to full text
Full (PDF)

p. 1079-1094

The Polish Digital Mathematics Library