bwmeta1.element.issn-2083-5892, Tome 34 (2014)

Sommaire

On Monochromatic Subgraphs of Edge-Colored Complete Graphs

Eric Andrews ; Futaba Fujie ; Kyle Kolasinski ; Chira Lumduanhom ; Adam Yusko

Access to full text
Full (PDF)

p. 5-22

The Polish Digital Mathematics Library

Hypergraphs with Pendant Paths are not Chromatically Unique

Ioan Tomescu

Access to full text
Full (PDF)

p. 23-29

The Polish Digital Mathematics Library

L(2, 1)-Labelings of Some Families of Oriented Planar Graphs

Sagnik Sen

Access to full text
Full (PDF)

p. 31-48

The Polish Digital Mathematics Library

A Note on the Permanental Roots of Bipartite Graphs

Heping Zhang ; Shunyi Liu ; Wei Li

Access to full text
Full (PDF)

p. 49-56

The Polish Digital Mathematics Library

Lattice-Like Total Perfect Codes

Carlos Araujo ; Italo Dejter

Access to full text
Full (PDF)

p. 57-74

The Polish Digital Mathematics Library

Supermagic Graphs Having a Saturated Vertex

Jaroslav Ivančo ; Tatiana Polláková

Access to full text
Full (PDF)

p. 75-84

The Polish Digital Mathematics Library

Packing the Hypercube

David Offner

Access to full text
Full (PDF)

p. 85-93

The Polish Digital Mathematics Library

The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number

Li Su ; Hong-Hai Li ; Jing Zhang

Access to full text
Full (PDF)

p. 95-102

The Polish Digital Mathematics Library

On The Determinant of q-Distance Matrix of a Graph

Hong-Hai Li ; Li Su ; Jing Zhang

Access to full text
Full (PDF)

p. 103-111

The Polish Digital Mathematics Library

On the Decompositions of Complete Graphs into Cycles and Stars on the Same Number of Edges

Atif A. Abueida ; Chester Lian

Access to full text
Full (PDF)

p. 113-125

The Polish Digital Mathematics Library

On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs

Dingguo Wang ; Erfang Shan

Access to full text
Full (PDF)

p. 127-136

The Polish Digital Mathematics Library

Tree-Like Partial Hamming Graphs

Tanja Gologranc

Access to full text
Full (PDF)

p. 137-150

The Polish Digital Mathematics Library

Maximum Hypergraphs without Regular Subgraphs

Jaehoon Kim ; Alexandr V. Kostochka

Access to full text
Full (PDF)

p. 151-166

The Polish Digital Mathematics Library

On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs

Pavol Hell ; César Hernández-Cruz

Access to full text
Full (PDF)

p. 167-185

The Polish Digital Mathematics Library

Smallest Regular Graphs of Given Degree and Diameter

Martin Knor

Access to full text
Full (PDF)

p. 187-191

The Polish Digital Mathematics Library

Star-Cycle Factors of Graphs

Yoshimi Egawa ; Mikio Kano ; Zheng Yan

Access to full text
Full (PDF)

p. 193-198

The Polish Digital Mathematics Library

Packing Trees Into n-Chromatic Graphs

András Gyárfás

Access to full text
Full (PDF)

p. 199-201

The Polish Digital Mathematics Library

Motion planning in cartesian product graphs

Biswajit Deb ; Kalpesh Kapoor

Access to full text
Full (PDF)

p. 207-221

The Polish Digital Mathematics Library

The ramsey number for theta graph versus a clique of order three and four

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

Access to full text
Full (PDF)

p. 223-232

The Polish Digital Mathematics Library

The depression of a graph and k-kernels

Mark Schurch ; Christine Mynhardt

Access to full text
Full (PDF)

p. 233-247

The Polish Digital Mathematics Library

A ramsey-type theorem for multiple disjoint copies of induced subgraphs

Tomoki Nakamigawa

Access to full text
Full (PDF)

p. 249-261

The Polish Digital Mathematics Library

The irregularity of graphs under graph operations

Hosam Abdo ; Darko Dimitrov

Access to full text
Full (PDF)

p. 263-278

The Polish Digital Mathematics Library

On the uniqueness of d-vertex magic constant

S. Arumugam ; N. Kamatchi ; G.R. Vijayakumar

Access to full text
Full (PDF)

p. 279-286

The Polish Digital Mathematics Library

Heavy subgraph pairs for traceability of block-chains

Binlong Li ; Hajo Broersma ; Shenggui Zhang

Access to full text
Full (PDF)

p. 287-307

The Polish Digital Mathematics Library

Rank numbers for bent ladders

Peter Richter ; Emily Leven ; Anh Tran ; Bryan Ek ; Jobby Jacob ; Darren A. Narayan

Access to full text
Full (PDF)

p. 309-329

The Polish Digital Mathematics Library

A decomposition of gallai multigraphs

Alexander Halperin ; Colton Magnant ; Kyle Pula

Access to full text
Full (PDF)

p. 331-352

The Polish Digital Mathematics Library

The niche graphs of interval orders

Jeongmi Park ; Yoshio Sano

Access to full text
Full (PDF)

p. 353-359

The Polish Digital Mathematics Library

Families of triples with high minimum degree are hamiltonian

Vojtech Rödl ; Andrzej Ruciński

Access to full text
Full (PDF)

p. 361-381

The Polish Digital Mathematics Library

On degree sets and the minimum orders in bipartite graphs

Y. Manoussakis ; H.P. Patil

Access to full text
Full (PDF)

p. 383-390

The Polish Digital Mathematics Library

On eulerian irregularity in graphs

Eric Andrews ; Chira Lumduanhom ; Ping Zhang

Access to full text
Full (PDF)

p. 391-408

The Polish Digital Mathematics Library

A note on pm-compact bipartite graphs

Jinfeng Liu ; Xiumei Wang

Access to full text
Full (PDF)

p. 409-413

The Polish Digital Mathematics Library

Maximal buttonings of trees

Ian Short

Access to full text
Full (PDF)

p. 415-420

The Polish Digital Mathematics Library

A note on face coloring entire weightings of plane graphs

Stanislav Jendrol ; Peter Šugerek

Access to full text
Full (PDF)

p. 421-426

The Polish Digital Mathematics Library

On the Existence of (k,l)-Kernels in Infinite Digraphs: A Survey

H. Galeana-Sánchez ; C. Hernández-Cruz

Access to full text
Full (PDF)

p. 431-466

The Polish Digital Mathematics Library

Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms

Kunal Dutta ; C.R. Subramanian

Access to full text
Full (PDF)

p. 467-495

The Polish Digital Mathematics Library

Two Graphs with a Common Edge

Lidia Badura

Access to full text
Full (PDF)

p. 497-507

The Polish Digital Mathematics Library

A Characterization of 2-Tree Probe Interval Graphs

David E. Brown ; Breeann M. Flesch ; J. Richard

Access to full text
Full (PDF)

p. 509-527

The Polish Digital Mathematics Library

A Reduction of the Graph Reconstruction Conjecture

S. Monikandan ; J. Balakumar

Access to full text
Full (PDF)

p. 529-537

The Polish Digital Mathematics Library

5-Stars of Low Weight in Normal Plane Maps with Minimum Degree 5

Oleg V. Borodin ; Anna O. Ivanova ; Tommy R. Jensen

Access to full text
Full (PDF)

p. 539-546

The Polish Digital Mathematics Library

Chromatic Polynomials of Mixed Hypercycles

Julian A. Allagan ; David Slutzky

Access to full text
Full (PDF)

p. 547-558

The Polish Digital Mathematics Library

Characterization of Cubic Graphs G with ir t (G) = Ir t (G) = 2

Changiz Eslahchi ; Shahab Haghi ; Nader Jafari

Access to full text
Full (PDF)

p. 559-565

The Polish Digital Mathematics Library

Tetravalent Arc-Transitive Graphs of Order 3p 2

Mohsen Ghasemi

Access to full text
Full (PDF)

p. 567-575

The Polish Digital Mathematics Library

On the Independence Number of Edge Chromatic Critical Graphs

Shiyou Pang ; Lianying Miao ; Wenyao Song ; Zhengke Miao

Access to full text
Full (PDF)

p. 577-584

The Polish Digital Mathematics Library

Degree Sequences of Monocore Graphs

Allan Bickle

Access to full text
Full (PDF)

p. 585-592

The Polish Digital Mathematics Library

Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs

Pablo De Caria ; Terry A. McKee

Access to full text
Full (PDF)

p. 593-602

The Polish Digital Mathematics Library

Downhill Domination in Graphs

Teresa W. Haynes ; Stephen T. Hedetniemi ; Jessie D. Jamieson ; William B. Jamieson

Access to full text
Full (PDF)

p. 603-612

The Polish Digital Mathematics Library

On Twin Edge Colorings of Graphs

Eric Andrews ; Laars Helenius ; Daniel Johnston ; Jonathon VerWys ; Ping Zhang

Access to full text
Full (PDF)

p. 613-627

The Polish Digital Mathematics Library

The Domination Number of K 3 n

John Georges ; Jianwei Lin ; David Mauro

Access to full text
Full (PDF)

p. 629-632

The Polish Digital Mathematics Library

A Different Short Proof of Brooks’ Theorem

Landon Rabern

Access to full text
Full (PDF)

p. 633-634

The Polish Digital Mathematics Library

On the Erdős-Gyárfás Conjecture in Claw-Free Graphs

Pouria Salehi Nowbandegani ; Hossein Esfandiari ; Mohammad Hassan Shirdareh Haghighi ; Khodakhast Bibak

Access to full text
Full (PDF)

p. 635-640

The Polish Digital Mathematics Library

A Note on a Broken-Cycle Theorem for Hypergraphs

Martin Trinks

Access to full text
Full (PDF)

p. 641-646

The Polish Digital Mathematics Library

Some Remarks On The Structure Of Strong K-Transitive Digraphs

César Hernández-Cruz ; Juan José Montellano-Ballesteros

Access to full text
Full (PDF)

p. 651-671

The Polish Digital Mathematics Library

Pairs Of Edges As Chords And As Cut-Edges

Terry A. McKee

Access to full text
Full (PDF)

p. 673-681

The Polish Digital Mathematics Library

The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices

Michitaka Furuya

Access to full text
Full (PDF)

p. 683-690

The Polish Digital Mathematics Library

On Super Edge-Antimagic Total Labeling Of Subdivided Stars

Muhammad Javaid

Access to full text
Full (PDF)

p. 691-706

The Polish Digital Mathematics Library

Color Energy Of A Unitary Cayley Graph

Chandrashekar Adiga ; E. Sampathkumar ; M.A. Sriraj

Access to full text
Full (PDF)

p. 707-721

The Polish Digital Mathematics Library

Strong Chromatic Index Of Planar Graphs With Large Girth

Gerard Jennhwa Chang ; Mickael Montassier ; Arnaud Pêche ; André Raspaud

Access to full text
Full (PDF)

p. 723-733

The Polish Digital Mathematics Library

Extremal Unicyclic Graphs With Minimal Distance Spectral Radius

Hongyan Lu ; Jing Luo ; Zhongxun Zhu

Access to full text
Full (PDF)

p. 735-749

The Polish Digital Mathematics Library

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

Gyula Y. Katona ; Morteza Faghani ; Ali Reza Ashrafi

Access to full text
Full (PDF)

p. 751-768

The Polish Digital Mathematics Library

The 1 , 2 , 3-Conjecture And 1 , 2-Conjecture For Sparse Graphs

Daniel W. Cranston ; Sogol Jahanbekam ; Douglas B. West

Access to full text
Full (PDF)

p. 769-799

The Polish Digital Mathematics Library

An Implicit Weighted Degree Condition For Heavy Cycles

Junqing Cai ; Hao Li ; Wantao Ning

Access to full text
Full (PDF)

p. 801-810

The Polish Digital Mathematics Library

The Well-Covered Dimension Of Products Of Graphs

Isaac Birnbaum ; Megan Kuneli ; Robyn McDonald ; Katherine Urabe ; Oscar Vega

Access to full text
Full (PDF)

p. 811-827

The Polish Digital Mathematics Library

Characterization Of Super-Radial Graphs

K.M. Kathiresan ; G. Marimuthu ; C. Parameswaran

Access to full text
Full (PDF)

p. 829-848

The Polish Digital Mathematics Library

A Note On Vertex Colorings Of Plane Graphs

Igor Fabricia ; Stanislav Jendrol’ ; Roman Soták

Access to full text
Full (PDF)

p. 849-855

The Polish Digital Mathematics Library

Note: The Smallest Nonevasive Graph Property

Michał Adamaszek

Access to full text
Full (PDF)

p. 857-862

The Polish Digital Mathematics Library