 |
BGW 2016 Accepted PapersDescriptions of generalized trees by logic and algebraic terms Partitioning sparse graphs into an independent set and a forest of bounded degree Degree constrained 2-partitions of tournaments Strong Rainbow Connection in Digraphs Characterization of Stable Equimatchable Graphs List star edge coloring of sparse graphs On the chromatic number of $2K_2$-free graphs On upper bounds for the independent transversal domination number Identifying codes for infinite triangular grids with a finite number of rows Independent $[1,2]$-domination of grids via min-plus algebra Hamiltonian Anti-Cycle on Sparse Graph Classes Collection of Codes for Tolerant Location On the list incidence chromatic number of graphs Packing coloring of circular ladders and generalized H-graphs On the proper connection number and the $2$-proper connection number of graphs Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs Subdivisions of oriented cycles in digraphs with large chromatic number On Strategies of Online Ramsey Game on Planar Graphs Neighbour distinguishing graph colourings - distant generalizations Quadrangulations of the projective plane are t-perfect if and only if they are bipartite Partitioning graphs into induced subgraphs First order and monadic second order logic of very sparse random graphs Generation of hypohamiltonian graphs Strengthening a Theorem of Tutte on the Hamiltonicity of Polyhedra Automorphism Groups of Comparability Graphs Decomposition of eulerian graphs into odd closed trails Power domination in triangulations Limited broadcast domination Toughness and hamiltonicity for special graph classes Chromatic number of ISK4-free graphs Minimally $LS_+$-imperfect claw-free graphs $\alpha$-labellings of lobsters with maximum degree three Class 0 Bounds for Graph Pebbling 3-Flows with Large Support Steinberg’s Conjecture is false Short cycle covers of signed graphs Covering signed eulerian graphs with signed circuits The threshold for the appearance of a properly coloured spanning tree in an edge coloured random graph A Study of k-dipath Colourings of Oriented Graphs Almost disjoint spanning trees Packing graphs of bounded codegree Group connectivity: Z_2^2 v. Z_4 Construction of permutation snarks of order $2\pmod8$ On the Spectra of Markov Matrices for Weighted Sierpinski Graphs Tournament limits: degree distributions and score functions Treelike snarks Edge-Intersection Graphs of Boundary-Generated Paths in a Grid Coloring uniform hypergraphs avoiding fixed rainbow subhypergraphs Graph minors operators for the marking game A Vizing-like theorem for union vertex-distinguishing edge coloring The neighbour-sum-distinguishing edge-colouring game On Group Divisible Designs $\GDD(m,n;2,\lambda)$ Square-free graphs are multiplicative Bounds for the Sum Choice Number The complexity of signed graph and edge-coloured graph homomorphisms Structure of plane graphs with prescribed $\delta, \rho, w$ and $w^*$ Parameterized complexity of fair deletion problems On a conjecture of Barat and Thomassen A Proof for a Conjecture of Gorgol. Partial cubes without $Q_3^-$ minors Homomorphisms from graph to integers Coloring and $L(2,1)$-labeling of unit disk intersection graphs On Girth of Minimal Counterexample to 5-Flow Conjecture Edge clique covers in graphs with independence number 2 Hausdorff dimension of graphs, fractal graphs and their combinatorial properties On a conjecture on k-Thue sequences Obstructions to bounded cutwidth Sharp Bounds for the Complexity of Semi-Equitable Coloring of Cubic and Subcubic Graphs
|
|
Sponsors:
|
