The following pages link to Graphs and Combinatorics (Q185060):
Displaying 50 items.
- GBRD's: Some new constructions for difference matrices, generalized Hadamard matrices and balanced generalized weighing matrices (Q1262868) (← links)
- Long induced paths and cycles in Kneser graphs (Q1263600) (← links)
- On directed graphs with an independent covering set (Q1264153) (← links)
- Maximal trees with bounded maximum degree in a graph (Q1268112) (← links)
- Complexity and algorithms for graph and hypergraph sandwich problems (Q1268114) (← links)
- Graphical basis partitions (Q1268118) (← links)
- On the panconnectivity of graphs with large degrees and neighborhood unions (Q1268119) (← links)
- Weak-geodetically closed subgraphs in distance-regular graphs (Q1268120) (← links)
- Frankl's conjecture is true for modular lattices (Q1272528) (← links)
- On two-way designs (Q1272529) (← links)
- Spectra of bipartite \(P\)- and \(Q\)-polynomial association schemes (Q1272530) (← links)
- Minimal oriented graphs of diameter 2 (Q1272532) (← links)
- Graphs with odd girth at least seven and high minimum degree (Q1272534) (← links)
- Intersection multigraphs of uniform hypergraphs (Q1272535) (← links)
- Complement of a graph: a generalization (Q1272536) (← links)
- Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor (Q1272538) (← links)
- Large sets of nearly orthogonal vectors (Q1288511) (← links)
- Graph decomposition of slim graphs (Q1288512) (← links)
- Finding large \(p\)-colored diameter two subgraphs (Q1288513) (← links)
- Independent trees in planar graphs (Q1288514) (← links)
- Type II matrices of size five (Q1288515) (← links)
- Rapid mixing of some linear matroids and other combinatorial objects (Q1288516) (← links)
- A new lower bound theorem for combinatorial \(2k\)-manifolds (Q1288518) (← links)
- Bipartite subgraphs of graphs with maximum degree three (Q1299990) (← links)
- \((2,k)\)-factor-critical graphs and toughness (Q1299991) (← links)
- Bipartite distance-regular graphs. I (Q1299992) (← links)
- Homogeneous embeddings of cycles in graphs (Q1299993) (← links)
- New optimal self-dual codes over GF(7). (Q1299994) (← links)
- Foldings of difference sets in abelian groups (Q1299995) (← links)
- Spectral characterization of some generalized odd graphs (Q1299998) (← links)
- Independent trees and branchings in planar multigraphs (Q1299999) (← links)
- Graphs with a small number of nonnegative eigenvalues (Q1300000) (← links)
- On Erdős's Eulerian trail game (Q1300001) (← links)
- A cellular triangle containing a specified point (Q1300003) (← links)
- Edge colouring of \(K_{2n}\) with spanning star-forests receiving distinct colours (Q1300004) (← links)
- On graphs \(G\) for which all large trees are \(G\)-good (Q1313348) (← links)
- On minimal embedding of two graphs as center and periphery (Q1313349) (← links)
- On uniformly geodetic graphs (Q1313350) (← links)
- The dynamics of the line and path graph operators (Q1313351) (← links)
- The complete graph \(t\)-packings and \(t\)-coverings (Q1313352) (← links)
- A new proof of Laman's theorem (Q1313353) (← links)
- Odd factors of a graph (Q1313354) (← links)
- A generalization of a result of Bauer and Schmeichel (Q1313355) (← links)
- On the edge reconstruction of graphs embedded on surfaces (Q1313356) (← links)
- Codings of graphs with binary edge labels (Q1323484) (← links)
- Packing of partial designs (Q1323485) (← links)
- Decompositions of complete graphs into isomorphic bipartite subgraphs (Q1323486) (← links)
- A short proof of Nash-Williams' theorem for the arboricity of a graph (Q1323488) (← links)
- Independent trees in graphs (Q1323489) (← links)
- Note on Hadamard tournaments of Szekeres type (Q1323491) (← links)
