scientific article; zbMATH DE number 3253072
From MaRDI portal
Publication:5539649
zbMath0157.31202MaRDI QIDQ5539649
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Decomposition of Graphs, SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS, New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings, On computing the path number of a graph, Path decompositions of triangle-free graphs, An overview of graph covering and partitioning, A note on biased and non-biased games, On the path separation number of graphs, Decompositions of highly connected graphs into paths of any given length, Decompositions of highly connected graphs into paths of length five, Decompositions of 6-regular bipartite graphs into paths of length six, Trigraphs, Gallai's conjecture for graphs with treewidth 3, Gallai's conjecture on path decompositions, Towards Gallai's path decomposition conjecture, Three ways to cover a graph, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Towards the Erdős-Gallai cycle decomposition conjecture, Graph theory. Abstracts from the workshop held January 2--8, 2022, Graphs which, with their complements, have certain clique covering numbers, Covers of Eulerian graphs, On Gallai's conjecture for graphs with maximum degree 6, Optimal path and cycle decompositions of dense quasirandom graphs, Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Hamilton path decompositions of complete multipartite graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Gallai's path decomposition conjecture for graphs of small maximum degree, Gallai's path decomposition conjecture for triangle-free planar graphs, Edge $k$-$q$-Colorability of Graphs, Minimal path decomposition of complete bipartite graphs, An improved upper bound and algorithm for clique covers, Hajós' conjecture and small cycle double covers of planar graphs, Long cycles, heavy cycles and cycle decompositions in digraphs, Path decompositions and Gallai's conjecture, On the triangle clique cover and \(K_t\) clique cover problems, The conjunction of the linear arboricity conjecture and Lovász's path partition theorem, Flip distances between graph orientations, Path and cycle decompositions of dense graphs, Efficient algorithms for path partitions, Applications of edge coverings by cliques, Covering arrays avoiding forbidden edges, On clique covers and independence numbers of graphs, Subgraph coverings and edge switchings, Upper bounds on the edge clique cover number of a graph, Decompositions of triangle-free 5-regular graphs into paths of length five
