Proper connection of graphs

Main
Proper connection of graphs

Proper connection of graphs

Valentin Borozan, Shinya Fujita, Aydin Gerek, Colton Magnant, Yannis Manoussakis, Leandro Montero, Zsolt Tuza

0 / 0

0 comments

How much do you like this book?

What’s the quality of the file?

Download the book for quality assessment

What’s the quality of the downloaded files?

Content Type:

Articles

Volume:

312

Year:

2012

Language:

english

Pages:

1

DOI:

10.1016/j.disc.2011.09.003

File:

PDF, 271 KB

english, 2012

pdf, 271 KB

Conversion to is in progress

Conversion to is failed

You may be interested in

Manoussakis, Y.; Spyratos, M.; Tuza, Zs. — Cycles of given color patterns

Jessica McDonald; Bojan Mohar; Diego Scheide — Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs

Hall, Martin; Magnant, Colton; Ozeki, Kenta; Tsugaki, Masao — Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles

Balakrishnan, R.; Ranganathan, K — [Universitext] A Textbook of Graph Theory ||

Li, Xueliang; Magnant, Colton; Qin, Zhongmei — [SpringerBriefs in Mathematics] Properly Colored Connectivity of Graphs ||

Li, Xueliang; Magnant, Colton; Qin, Zhongmei — [SpringerBriefs in Mathematics] Properly Colored Connectivity of Graphs || Directed Graphs

Y. Manoussakis; M. Spyratos; Zs. Tuza; M. Voigt — Minimal colorings for properly colored subgraphs

Ruy Fabila-Monroy; David Flores-Peñaloza; Clemens Huemer; Ferran Hurtado; Jorge Urrutia; David R. Wood — Token Graphs

Brause, Christoph; Doan, Trung Duy; Schiermeyer, Ingo — Minimum Degree Conditions for the Proper Connection Number of Graphs

Robert Katić,Colton Magnant,Pouria Salehi Nowbandegani — Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs

Melville, Robert; Goddard, Wayne — Coloring Graphs to Produce Properly Colored Walks

Balogh, József; Barát, János; Gerbner, Dániel; Gyárfás, András; Sárközy, Gábor N — Partitioning 2-edge-colored graphs by monochromatic paths and cycles

Fei Huang,Xueliang Li,Shujing Wang — Upper bounds of proper connection number of graphs

Guo, Shanshan; Huang, Fei; Yuan, Jinjiang — Two Sufficient Conditions for 2-Connected Graphs to Have Proper Connection Number 2

Hong-Jian Lai — Supereulerian graphs and excluded induced minors

Y. Manoussakis — Alternating paths in edge-colored complete graphs

P. Hell; Y. Manoussakis; Zs. Tuza — Packing problems in edge-colored graphs

Shinya Fujita; Colton Magnant — Properly colored paths and cycles

Weihua Yang; Hongjian Lai; Hao Li; Xiaofeng Guo — Collapsible graphs and Hamiltonian connectedness of line graphs

Chen, Xiaozheng; Huang, Fei; Yuan, Jinjiang — Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles

Li, Xihe; Wang, Ligong — -connected subgraphs

Joshua Evan Greene — Chromatic capacities of graphs and hypergraphs

Roman Čada; Tomáš Kaiser; Moshe Rosenfeld; Zdeněk Ryjáček — Hamiltonian decompositions of prisms over cubic graphs

Michael Ferrara; Ronald Gould; Gerard Tansey; Thor Whalen — Disjoint hamiltonian cycles in bipartite graphs

Tao Jiang — Canonical Ramsey numbers and properly colored cycles

Guanghui Wang; Hao Li — Color degree and alternating cycles in edge-colored graphs

Shinya Fujita; Colton Magnant — Gallai–Ramsey numbers for cycles

Shinya Fujita — Some remarks on long monochromatic cycles in edge-colored complete graphs

Li, Hao — Rainbow ’s and ’s in edge-colored graphs

Akbari, Saieed; Jensen, Tommy R.; Siggers, Mark — Decompositions of graphs into trees, forests, and regular subgraphs

Bensmail, Julien; Lagoutte, Aurélie; Valicov, Petru — Strong edge-coloring of <mml:math altimg="si5.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.else

Huang, Mingfang; Yu, Gexin; Zhou, Xiangqian — The strong chromatic index of <mml:math id="mml1" display="inline" overflow="scroll" altimg="si1.gif" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce=

Most frequently terms