HEADER_BACKGROUND
Bordeaux Graph Workshop
Bordeaux, November 7-10, 2016.
Enseirb-Matmeca - 1 Avenue du Docteur Albert Schweitzer, 33600 Talence
> [BGW 2016] / List of accepted papers

BGW 2016 is the fourth edition of Bordeaux Graph Workshop.
Organized by the "Graphs and Optimisation" group.
BGW 2016 Accepted Papers

BGW 2016 Accepted Papers

Bruno Courcelle. Descriptions of generalized trees by logic and algebraic terms
François Dross, Mickaël Montassier and Alexandre Pinlou. Partitioning sparse graphs into an independent set and a forest of bounded degree
Joergen Bang-Jensen and Tilde My Larsen. Degree constrained 2-partitions of tournaments
Elżbieta Sidorowicz and Éric Sopena. Strong Rainbow Connection in Digraphs
Zakir Deniz and Tinaz Ekim. Characterization of Stable Equimatchable Graphs
Samia Kerdjoudj and André Raspaud. List star edge coloring of sparse graphs
Christoph Brause, Bert Randerath, Ingo Schiermeyer and Elkin Vumar. On the chromatic number of $2K_2$-free graphs
Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer and Elkin Vumar. On upper bounds for the independent transversal domination number
Rennan Dantas, Frederic Havet and Rudini Sampaio. Identifying codes for infinite triangular grids with a finite number of rows
Sahar Aleid, José Cáceres and Maria Luz Puertas. Independent $[1,2]$-domination of grids via min-plus algebra
Pavel Dvořák, Dušan Knop and Tomáš Masařík. Hamiltonian Anti-Cycle on Sparse Graph Classes
Ville Junnila and Tero Laihonen. Collection of Codes for Tolerant Location
Brahim Benmedjdoub, Éric Sopena and Isma Bouchemakh. On the list incidence chromatic number of graphs
Daouya Laiche, Éric Sopena and Isma Bouchemakh. Packing coloring of circular ladders and generalized H-graphs
Christoph Brause, Trung Duy Doan and Ingo Schiermeyer. On the proper connection number and the $2$-proper connection number of graphs
Ruth Haas and Gary Macgillivray. Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs
Nathann Cohen, Frederic Havet, William Lochet and Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number
Pavel Dvořák and Tomáš Valla. On Strategies of Online Ramsey Game on Planar Graphs
Jakub Przybyło. Neighbour distinguishing graph colourings - distant generalizations
Elke Fuchs and Laura Gellert. Quadrangulations of the projective plane are t-perfect if and only if they are bipartite
Dušan Knop. Partitioning graphs into induced subgraphs
Maksim Zhukovskii. First order and monadic second order logic of very sparse random graphs
Jan Goedgebeur and Carol Zamfirescu. Generation of hypohamiltonian graphs
Gunnar Brinkmann and Carol Zamfirescu. Strengthening a Theorem of Tutte on the Hamiltonicity of Polyhedra
Pavel Klavík and Peter Zeman. Automorphism Groups of Comparability Graphs
Edita Máčajová and Martin Škoviera. Decomposition of eulerian graphs into odd closed trails
Paul Dorbec, Antonio Gonzalez and Claire Pennarun. Power domination in triangulations
José Cáceres, Carmen Hernando, Mercè Mora, Ignacio M. Pelayo and María Luz Puertas. Limited broadcast domination
Hajo Broersma, Adam Kabela, Hao Qi and Elkin Vumar. Toughness and hamiltonicity for special graph classes
Ngoc Khang Le. Chromatic number of ISK4-free graphs
Silvia Bianchi, Mariana Escalante, Graciela Nasini and Annegret Wagler. Minimally $LS_+$-imperfect claw-free graphs
Atílio Luiz, C.N. Campos and R. Bruce Richter. $\alpha$-labellings of lobsters with maximum degree three
Daniel Cranston, Luke Postle, Chenxiao Xue and Carl Yerger. Class 0 Bounds for Graph Pebbling
Matt Devos, Jessica McDonald, Irene Pivotto, Edita Rollová and Robert Šámal. 3-Flows with Large Support
Vincent Cohen-Addad, Michael Hebdige, Daniel Kráľ, Zhentao Li and Esteban Salgado. Steinberg’s Conjecture is false
Tomáš Kaiser, Robert Lukoťka, Edita Máčajová and Edita Rollová. Short cycle covers of signed graphs
Edita Máčajová, Edita Rollová and Martin Škoviera. Covering signed eulerian graphs with signed circuits
Pu Gao, Carlos Hoppen and Juliana Sanches. The threshold for the appearance of a properly coloured spanning tree in an edge coloured random graph
Christopher Duffy, Gary MacGillivray and Éric Sopena. A Study of k-dipath Colourings of Oriented Graphs
Benoit Darties, Nicolas Gastineau and Olivier Togni. Almost disjoint spanning trees
Wouter Cames van Batenburg and Ross Kang. Packing graphs of bounded codegree
Radek Hušek, Lucie Mohelníková and Robert Šámal. Group connectivity: Z_2^2 v. Z_4
Edita Máčajová and Martin Škoviera. Construction of permutation snarks of order $2\pmod8$
Francesc Comellas, Zhongzhi Zhang and Pinchen Xie. On the Spectra of Markov Matrices for Weighted Sierpinski Graphs
Erik Thörnblad. Tournament limits: degree distributions and score functions
Marien Abreu, Tomas Kaiser, Domenico Labbate and Giuseppe Mazzuoccolo. Treelike snarks
Martin Charles Golumbic, Gila Morgenstern and Deepak Rajendraprasad. Edge-Intersection Graphs of Boundary-Generated Paths in a Grid
Lucas De Oliveira Contiero, Carlos Hoppen, Hanno Lefmann and Knut Odermann. Coloring uniform hypergraphs avoiding fixed rainbow subhypergraphs
Gabriela Paris. Graph minors operators for the marking game
Nicolas Bousquet, Antoine Dailly, Éric Duchêne, Hamamache Kheddouci and Aline Parreau. A Vizing-like theorem for union vertex-distinguishing edge coloring
Mohammed Senhaji,Éric Sopena, Olivier Baudon, Mariusz Wożniak, Jakub Przybyło and Elżbieta Sidorowicz. The neighbour-sum-distinguishing edge-colouring game
Panon Sinsap and Chariya Uiyyasathian. On Group Divisible Designs $\GDD(m,n;2,\lambda)$
Marcin Wrochna. Square-free graphs are multiplicative
Arnfried Kemnitz, Jochen Harant, Massimiliano Marangio and Margit Voigt. Bounds for the Sum Choice Number
Richard Brewster, Florent Foucaud, Pavol Hell and Reza Naserasr. The complexity of signed graph and edge-coloured graph homomorphisms
Mária Maceková, Peter Hudák, Tomáš Madaras and Pavol Široczki. Structure of plane graphs with prescribed $\delta, \rho, w$ and $w^*$
Tomáš Masařík and Tomáš Toufar. Parameterized complexity of fair deletion problems
Ararat Harutyunyan, Tien Nam Le, Julien Bensmail, Martin Merker and Stephan Thomasse. On a conjecture of Barat and Thomassen
Victor Campos and Raul Lopes. A Proof for a Conjecture of Gorgol.
Victor Chepoi, Kolja Knauer and Tilen Marc. Partial cubes without $Q_3^-$ minors
Jan Bok and Jaroslav Nešetřil. Homomorphisms from graph to integers
Konstanty Junosza-Szaniawski, Paweł Rzążewski, Joanna Sokół and Krzysztof Węsek. Coloring and $L(2,1)$-labeling of unit disk intersection graphs
Radek Hušek, Peter Korcsok and Robert Šámal. On Girth of Minimal Counterexample to 5-Flow Conjecture
Ben Seamone, Manuel Lafond, Gena Hahn, Pierre Charbit, Marcin Kamiński, Reza Naserasr, Rezvan Sherkati and Nicolas Lichiardopol. Edge clique covers in graphs with independence number 2
Pavel Skums and Leonid Bunimovich. Hausdorff dimension of graphs, fractal graphs and their combinatorial properties
Borut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou and Roman Soták. On a conjecture on k-Thue sequences
Archontia Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios Thilikos and Marcin Wrochna. Obstructions to bounded cutwidth
Hanna Furmańczyk and Marek Kubale. Sharp Bounds for the Complexity of Semi-Equitable Coloring of Cubic and Subcubic Graphs


Sponsors:














Programme financé par l'ANR - n° ANR-10-IDEX-03-02



89px">

Sponsors:














Programme financé par l'ANR - n° ANR-10-IDEX-03-02