bwmeta1.element.issn-2083-5892, Tome 36 (2016)

Sommaire

Dense Arbitrarily Partitionable Graphs

Rafał Kalinowski ; Monika Pilśniak ; Ingo Schiermeyer ; Mariusz Woźniak

Access to full text
Full (PDF)

p. 5-22

The Polish Digital Mathematics Library

Split Euler Tours In 4-Regular Planar Graphs

PJ Couch ; B.D. Daniel ; R. Guidry ; W. Paul Wright

Access to full text
Full (PDF)

p. 23-30

The Polish Digital Mathematics Library

Note On The Game Colouring Number Of Powers Of Graphs

Stephan Dominique Andres ; Andrea Theuser

Access to full text
Full (PDF)

p. 31-42

The Polish Digital Mathematics Library

Products Of Digraphs And Their Competition Graphs

Martin Sonntag ; Hanns-Martin Teichert

Access to full text
Full (PDF)

p. 43-58

The Polish Digital Mathematics Library

M 2 -Edge Colorings Of Cacti And Graph Joins

Július Czap ; Peter Šugerek ; Jaroslav Ivančo

Access to full text
Full (PDF)

p. 59-69

The Polish Digital Mathematics Library

Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree

Michael A. Henning ; Alister J. Marcon

Access to full text
Full (PDF)

p. 71-93

The Polish Digital Mathematics Library

Unique-Maximum Coloring Of Plane Graphs

Igor Fabrici ; Frank Göring

Access to full text
Full (PDF)

p. 95-102

The Polish Digital Mathematics Library

γ-Cycles In Arc-Colored Digraphs

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

Access to full text
Full (PDF)

p. 103-116

The Polish Digital Mathematics Library

Maximum Edge-Colorings Of Graphs

Stanislav Jendrol’ ; Michaela Vrbjarová

Access to full text
Full (PDF)

p. 117-125

The Polish Digital Mathematics Library

On Spectra Of Variants Of The Corona Of Two Graphs And Some New Equienergetic Graphs

Chandrashekar Adiga ; B.R. Rakshith

Access to full text
Full (PDF)

p. 127-140

The Polish Digital Mathematics Library

On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs

Július Czap ; Jakub Przybyło ; Erika Škrabuľáková

Access to full text
Full (PDF)

p. 141-151

The Polish Digital Mathematics Library

Bounds On The Disjunctive Total Domination Number Of A Tree

Michael A. Henning ; Viroshan Naicker

Access to full text
Full (PDF)

p. 153-171

The Polish Digital Mathematics Library

A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs

Wojciech Wideł

Access to full text
Full (PDF)

p. 173-184

The Polish Digital Mathematics Library

Weak Total Resolvability In Graphs

Katrin Casel ; Alejandro Estrada-Moreno ; Henning Fernau ; Juan Alberto Rodríguez-Velázquez

Access to full text
Full (PDF)

p. 185-210

The Polish Digital Mathematics Library

Supermagic Generalized Double Graphs 1

Jaroslav Ivančo

Access to full text
Full (PDF)

p. 211-225

The Polish Digital Mathematics Library

Light Graphs In Planar Graphs Of Large Girth

Peter Hudák ; Mária Maceková ; Tomáš Madaras ; Pavol Široczki

Access to full text
Full (PDF)

p. 227-238

The Polish Digital Mathematics Library

Hamiltonicity and Generalised Total Colourings of Planar Graphs

Mieczysław Borowiecki ; Izak Broere

Access to full text
Full (PDF)

p. 243-257

The Polish Digital Mathematics Library

Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees

Péter G.N. Szabó

Access to full text
Full (PDF)

p. 259-278

The Polish Digital Mathematics Library

Solutions of Some L(2, 1)-Coloring Related Open Problems

Nibedita Mandal ; Pratima Panigrahi

Access to full text
Full (PDF)

p. 279-297

The Polish Digital Mathematics Library

Distance Magic Cartesian Products of Graphs

Sylwia Cichacz ; Dalibor Froncek ; Elliot Krop ; Christopher Raridan

Access to full text
Full (PDF)

p. 299-308

The Polish Digital Mathematics Library

Kernels by Monochromatic Paths and Color-Perfect Digraphs

Hortensia Galeana-Śanchez ; Rocío Sánchez-López

Access to full text
Full (PDF)

p. 309-321

The Polish Digital Mathematics Library

A Maximum Resonant Set of Polyomino Graphs

Heping Zhang ; Xiangqian Zhou

Access to full text
Full (PDF)

p. 323-337

The Polish Digital Mathematics Library

3-Paths in Graphs with Bounded Average Degree

Stanislav Jendrol′ ; Mária Maceková ; Mickaël Montassier ; Roman Soták

Access to full text
Full (PDF)

p. 339-353

The Polish Digital Mathematics Library

Hardness Results for Total Rainbow Connection of Graphs

Lily Chen ; Bofeng Huo ; Yingbin Ma

Access to full text
Full (PDF)

p. 355-362

The Polish Digital Mathematics Library

Large Degree Vertices in Longest Cycles of Graphs, I

Binlong Li ; Liming Xiong ; Jun Yin

Access to full text
Full (PDF)

p. 363-382

The Polish Digital Mathematics Library

Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs

Binlong Lia ; Shenggui Zhang

Access to full text
Full (PDF)

p. 383-392

The Polish Digital Mathematics Library

End Simplicial Vertices in Path Graphs

Marisa Gutierrez ; Silvia B. Tondato

Access to full text
Full (PDF)

p. 393-408

The Polish Digital Mathematics Library

A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs

Sizhong Zhou ; Fan Yang ; Zhiren Sun

Access to full text
Full (PDF)

p. 409-418

The Polish Digital Mathematics Library

The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs

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

Access to full text
Full (PDF)

p. 419-426

The Polish Digital Mathematics Library

A Characterization of Hypergraphs with Large Domination Number

Michael A. Henning ; Christian Löwenstein

Access to full text
Full (PDF)

p. 427-438

The Polish Digital Mathematics Library

Characterizations of Graphs Having Large Proper Connection Numbers

Chira Lumduanhom ; Elliot Laforge ; Ping Zhang

Access to full text
Full (PDF)

p. 439-453

The Polish Digital Mathematics Library

The Steiner Wiener Index of A Graph

Xueliang Li ; Yaping Mao ; Ivan Gutman

Access to full text
Full (PDF)

p. 455-465

The Polish Digital Mathematics Library

New Bounds on the Signed Total Domination Number of Graphs

Seyyed Mehdi Hosseini Moghaddam ; Doost Ali Mojdeh ; Babak Samadi ; Lutz Volkmann

Access to full text
Full (PDF)

p. 467-477

The Polish Digital Mathematics Library

The Quest for A Characterization of Hom-Properties of Finite Character

Izak Broere ; Moroli D.V. Matsoha ; Johannes Heidema

Access to full text
Full (PDF)

p. 479-500

The Polish Digital Mathematics Library

Extremal Matching Energy of Complements of Trees

Tingzeng Wu ; Weigen Yan ; Heping Zhang

Access to full text
Full (PDF)

p. 505-521

The Polish Digital Mathematics Library

Cycle Double Covers of Infinite Planar Graphs

Mohammad Javaheri

Access to full text
Full (PDF)

p. 523-544

The Polish Digital Mathematics Library

Looseness and Independence Number of Triangulations on Closed Surfaces

Atsuhiro Nakamoto ; Seiya Negami ; Kyoji Ohba ; Yusuke Suzuki

Access to full text
Full (PDF)

p. 545-554

The Polish Digital Mathematics Library

A New Proof that 4-Connected Planar Graphs are Hamiltonian-Connected

Xiaoyun Lu ; Douglas B. West

Access to full text
Full (PDF)

p. 555-564

The Polish Digital Mathematics Library

On Longest Cycles in Essentially 4-Connected Planar Graphs

Igor Fabrici ; Jochen Harant ; Stanislav Jendroľ

Access to full text
Full (PDF)

p. 565-575

The Polish Digital Mathematics Library

The Smallest Non-Autograph

Benjamin S. Baumer ; Yijin Wei ; Gary S. Bloom

Access to full text
Full (PDF)

p. 577-602

The Polish Digital Mathematics Library

On the Weight of Minor Faces in Triangle-Free 3-Polytopes

Oleg V. Borodin ; Anna O. Ivanova

Access to full text
Full (PDF)

p. 603-619

The Polish Digital Mathematics Library

The Ryjáček Closure and a Forbidden Subgraph

Akira Saito ; Liming Xiong

Access to full text
Full (PDF)

p. 621-628

The Polish Digital Mathematics Library

Various Bounds for Liar’s Domination Number

Abdollah Alimadadi ; Doost Ali Mojdeh ; Nader Jafari Rad

Access to full text
Full (PDF)

p. 629-641

The Polish Digital Mathematics Library

Triangle Decompositions of Planar Graphs

Christina M. Mynhardt ; Christopher M. van Bommel

Access to full text
Full (PDF)

p. 643-659

The Polish Digital Mathematics Library

Some Variations of Perfect Graphs

Magda Dettlaff ; Magdalena Lemańska ; Gabriel Semanišin ; Rita Zuazua

Access to full text
Full (PDF)

p. 661-668

The Polish Digital Mathematics Library

The Vertex-Rainbow Index of A Graph

Yaping Mao

Access to full text
Full (PDF)

p. 669-681

The Polish Digital Mathematics Library

The Turán Number of the Graph 2P5

Halina Bielak ; Sebastian Kieliszek

Access to full text
Full (PDF)

p. 683-694

The Polish Digital Mathematics Library

Nordhaus-Gaddum-Type Results for Resistance Distance-Based Graph Invariants

Kinkar Ch. Das ; Yujun Yang ; Kexiang Xu

Access to full text
Full (PDF)

p. 695-707

The Polish Digital Mathematics Library

Sum List Edge Colorings of Graphs

Arnfried Kemnitz ; Massimiliano Marangio ; Margit Voigt

Access to full text
Full (PDF)

p. 709-722

The Polish Digital Mathematics Library

Splitting Cubic Circle Graphs

Lorenzo Traldi

Access to full text
Full (PDF)

p. 723-741

The Polish Digital Mathematics Library

On Path-Pairability in the Cartesian Product of Graphs

Gábor Mészáros

Access to full text
Full (PDF)

p. 743-758

The Polish Digital Mathematics Library

K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum

Csilla Bujtás ; Zsolt Tuza

Access to full text
Full (PDF)

p. 759-772

The Polish Digital Mathematics Library

Spanning Trees whose Stems have a Bounded Number of Branch Vertices

Zheng Yan

Access to full text
Full (PDF)

p. 773-778

The Polish Digital Mathematics Library

Perfect Set of Euler Tours of Kp,p,p

T. Govindan ; A. Muthusamy

Access to full text
Full (PDF)

p. 783-796

The Polish Digital Mathematics Library

Integral Cayley Sum Graphs and Groups

Xuanlong Ma ; Kaishun Wang

Access to full text
Full (PDF)

p. 797-803

The Polish Digital Mathematics Library

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao ; Minyong Shi ; Lihua Feng

Access to full text
Full (PDF)

p. 805-817

The Polish Digital Mathematics Library

Niche Hypergraphs

Christian Garske ; Martin Sonntag ; Hanns-Martin Teichert

Access to full text
Full (PDF)

p. 819-832

The Polish Digital Mathematics Library

Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

Yuefang Sun

Access to full text
Full (PDF)

p. 833-843

The Polish Digital Mathematics Library

Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges

Yi-Zheng Fan ; Ying-Ying Tan ; Xi-Xi Peng ; An-Hong Liu

Access to full text
Full (PDF)

p. 845-856

The Polish Digital Mathematics Library

Edge-Transitive Lexicographic and Cartesian Products

Wilfried Imrich ; Ali Iranmanesh ; Sandi Klavžar ; Abolghasem Soltani

Access to full text
Full (PDF)

p. 857-865

The Polish Digital Mathematics Library

The Gutman Index and the Edge-Wiener Index of Graphs with Given Vertex-Connectivity

Jaya Percival Mazorodze ; Simon Mukwembi ; Tomáš Vetrík

Access to full text
Full (PDF)

p. 867-876

The Polish Digital Mathematics Library

On the Complexity of Reinforcement in Graphs

Nader Jafari Rad

Access to full text
Full (PDF)

p. 877-887

The Polish Digital Mathematics Library

An Extension of Kotzig’s Theorem

Valerii A. Aksenov ; Oleg V. Borodin ; Anna O. Ivanova

Access to full text
Full (PDF)

p. 889-897

The Polish Digital Mathematics Library

The Dynamics of the Forest Graph Operator

Suresh Dara ; S.M. Hegde ; Venkateshwarlu Deva ; S.B. Rao ; Thomas Zaslavsky

Access to full text
Full (PDF)

p. 899-913

The Polish Digital Mathematics Library

Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs

Binlong Li ; Hajo J. Broersma ; Shenggui Zhang

Access to full text
Full (PDF)

p. 915-929

The Polish Digital Mathematics Library

Graphs with Large Generalized (Edge-)Connectivity

Xueliang Li ; Yaping Mao

Access to full text
Full (PDF)

p. 931-958

The Polish Digital Mathematics Library

Bounds for the b-Chromatic Number of Subgraphs and Edge-Deleted Subgraphs

P. Francis ; S. Francis Raj

Access to full text
Full (PDF)

p. 959-976

The Polish Digital Mathematics Library

Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs

Weige Xi ; Ligong Wang

Access to full text
Full (PDF)

p. 977-988

The Polish Digital Mathematics Library

Vertex Colorings without Rainbow Subgraphs

Wayne Goddard ; Honghai Xu

Access to full text
Full (PDF)

p. 989-1005

The Polish Digital Mathematics Library

Radio Graceful Hamming Graphs

Amanda Niedzialomski

Access to full text
Full (PDF)

p. 1007-1020

The Polish Digital Mathematics Library

A Note on Path Domination

Liliana Alcón

Access to full text
Full (PDF)

p. 1021-1034

The Polish Digital Mathematics Library

Edge-Transitivity of Cayley Graphs Generated by Transpositions

Ashwin Ganesan

Access to full text
Full (PDF)

p. 1035-1042

The Polish Digital Mathematics Library

A Note on Non-Dominating Set Partitions in Graphs

Wyatt J. Desormeaux ; Teresa W. Haynes ; Michael A. Henning

Access to full text
Full (PDF)

p. 1043-1050

The Polish Digital Mathematics Library

Closed Formulae for the Strong Metric Dimension of Lexicographi

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

Access to full text
Full (PDF)

p. 1051-1064

The Polish Digital Mathematics Library