The following pages link to (Q5539649):
Displayed 45 items.
- On the path separation number of graphs (Q313786) (← links)
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Upper bounds on the edge clique cover number of a graph (Q799696) (← links)
- Three ways to cover a graph (Q898135) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Trigraphs (Q1124613) (← links)
- Graphs which, with their complements, have certain clique covering numbers (Q1158174) (← links)
- Hajós' conjecture and small cycle double covers of planar graphs (Q1197036) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- Hamilton path decompositions of complete multipartite graphs (Q1719570) (← links)
- Gallai's path decomposition conjecture for graphs of small maximum degree (Q1732759) (← links)
- Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776) (← links)
- Minimal path decomposition of complete bipartite graphs (Q1743479) (← links)
- An improved upper bound and algorithm for clique covers (Q1748206) (← links)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- Efficient algorithms for path partitions (Q1813975) (← links)
- On clique covers and independence numbers of graphs (Q1839263) (← links)
- Subgraph coverings and edge switchings (Q1850576) (← links)
- A note on biased and non-biased games (Q1894371) (← links)
- Long cycles, heavy cycles and cycle decompositions in digraphs (Q1998760) (← links)
- The conjunction of the linear arboricity conjecture and Lovász's path partition theorem (Q2032853) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- Path decompositions of triangle-free graphs (Q2138955) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On Gallai's conjecture for graphs with maximum degree 6 (Q2214064) (← links)
- On the triangle clique cover and \(K_t\) clique cover problems (Q2279271) (← links)
- Decompositions of triangle-free 5-regular graphs into paths of length five (Q2352046) (← links)
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Decompositions of 6-regular bipartite graphs into paths of length six (Q2657084) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- On the Decomposition of Graphs (Q3964612) (← links)
- Edge $k$-$q$-Colorability of Graphs (Q4637664) (← links)
- SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS (Q5036151) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Gallai's conjecture on path decompositions (Q6047576) (← links)
- Towards Gallai's path decomposition conjecture (Q6055934) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)