The following pages link to (Q5422499):
Displaying 25 items.
- Black-box Trace\&Revoke codes (Q378263) (← links)
- Graph of BCI-algebras (Q417237) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- Incidence coloring of pseudo-Halin graphs (Q713146) (← links)
- The number of \(k\)-colorings of a graph on a fixed surface (Q856865) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- Domination game critical graphs (Q891326) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- A basic elementary extension of the Duchet-Meyniel theorem (Q960956) (← links)
- Complement reducible graphs (Q1153105) (← links)
- Disjoint cliques and disjoint maximal independent sets of vertices in graphs (Q1168336) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes (Q1733044) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- Chromatic roots and Hamiltonian paths (Q1850497) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Decomposing a planar graph into an independent set and a 3-degenerate graph (Q1850567) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Connectivity and Hamiltonicity of canonical colouring graphs of bipartite and complete multipartite graphs (Q2331438) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Searching for (near) Optimal Codes (Q3467868) (← links)
- Wiener-type invariants on graph properties (Q5014376) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)
