Discussiones Mathematicae. Graph Theory, Tome 34 (2014) no. 3

Geodesic

Parcourir par

Volume 34 (2014) no. 3

Sommaire

On the existence of (k,l)-kernels in infinite digraphs: A survey

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

p. 431-466

Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms

Dutta, Kunal ; Subramanian, C.R.

p. 467-495

Two graphs with a common edge

Badura, Lidia

p. 497-507

A characterization of 2-tree probe interval graphs

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

p. 509-527

A reduction of the Graph Reconstruction Conjecture

Monikandan, S. ; Balakumar, J.

p. 529-537

5-stars of low weight in normal plane maps with minimum degree 5

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

p. 539-546

Chromatic polynomials of mixed hypercycles

Allagan, Julian A. ; Slutzky, David

p. 547-558

Characterization of cubic graphs

G

with

i r_{t} (G) = I R_{t} (G) = 2

Eslahchi, Changiz ; Haghi, Shahab ; Jafari Rad, Nader

p. 559-565

Tetravalent arc-transitive graphs of order

3 p^{2}

Ghasemi, Mohsen

p. 567-575

On the independence number of edge chromatic critical graphs

Pang, Shiyou ; Miao, Lianying ; Song, Wenyao ; Miao, Zhengke

p. 577-584

Degree sequences of monocore graphs

Bickle, Allan

p. 585-592

Maxclique and unit disk characterizations of strongly chordal graphs

Caria, Pablo De ; McKee, Terry A.

p. 593-602

Downhill domination in graphs

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

p. 603-612

On twin edge colorings of graphs

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

p. 613-627

The domination number of

K_{n}^{3}

Georges, John ; Lin, Jianwei ; Mauro, David

p. 629-632

A different short proof of Brook's theorem

Rabern, Landon

p. 633-634

On the Erdős-Gyárfás conjecture in claw-free graphs

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

p. 635-640

A note on a broken-cycle theorem for hypergraphs

Trinks, Martin

p. 641-646