scientific article; zbMATH DE number 3238444
From MaRDI portal
Publication:5525916
Cited in
(29)- A problem on algebraic graph theory
- Inequalities for two set systems with prescribed intersections
- Local k-colorings of graphs and hypergraphs
- Hypergraph coverings and local colorings
- Distances in orientations of graphs
- Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices
- Upper and lower bounds for graph-diameter problems with application to Record allocation
- Can visibility graphs be represented compactly?
- Biclique cover and local clique cover of graphs
- Matchings and covers in hypergraphs
- On the extremal combinatorics of the Hamming space
- Bipartite Hansel results for hypergraphs
- scientific article; zbMATH DE number 5881230 (Why is no real title available?)
- On the Decomposition of Graphs
- scientific article; zbMATH DE number 15129 (Why is no real title available?)
- Biclique covers and partitions
- scientific article; zbMATH DE number 519999 (Why is no real title available?)
- Rainbow saturation and graph capacities
- On Four Problems in Graph Theory
- Search when the lie depends on the target
- Erdős-Pyber theorem for hypergraphs and secret sharing
- Fault tolerant networks of specified diameter
- On coloring parameters of triangle-free planar (n, m)-graphs
- Support testing in the huge object model
- Counting the minimum number of arcs in an oriented graph having weak diameter 2
- Saturation of edge-ordered graphs
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Separating systems and oriented graphs of diameter two
- On separating systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525916)
