The following pages link to (Q5315023):
Displayed 50 items.
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- Bandwidth theorem for random graphs (Q765187) (← links)
- Maximizing edge-ratio is NP-complete (Q765326) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- On bipartite graphs of defect at most 4 (Q765348) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Embedding meshes/tori in faulty crossed cubes (Q765478) (← links)
- Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree (Q765971) (← links)
- Connectivity of workflow nets: The foundations of stepwise verification (Q766173) (← links)
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- On the balanced minimum evolution polytope (Q783026) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- TDBS: A time division beacon scheduling mechanism for ZigBee cluster-tree wireless sensor networks (Q842731) (← links)
- Subgraph transversal of graphs (Q844218) (← links)
- Induced-universal graphs for graphs with bounded maximum degree (Q844226) (← links)
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links (Q845346) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Coarse differentiation and multi-flows in planar graphs (Q848676) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs (Q854415) (← links)
- End spaces and spanning trees (Q859612) (← links)
- Hypergraphs and the Clar problem in hexagonal systems (Q865759) (← links)
- Cycles and communicating classes in membrane systems and molecular dynamics (Q872209) (← links)
- On semiextensions and circuit double covers (Q875950) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Turán's theorem for pseudo-random graphs (Q880006) (← links)
- A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network (Q881846) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- Directed elimination games (Q896668) (← links)
- The journey of the union-closed sets conjecture (Q897265) (← links)
- Critical exponents of graphs (Q899490) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Linked graphs with restricted lengths (Q933678) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- End spaces of graphs are normal (Q933681) (← links)
- Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
- Trees with extremal numbers of maximal independent sets including the set of leaves (Q942106) (← links)
- Generalizations of Abel's and Hurwitz's identities (Q942121) (← links)
- Computing knot Floer homology in cyclic branched covers (Q945653) (← links)
- A weaker version of Lovász' path removal conjecture (Q947724) (← links)
- Connected but not path-connected subspaces of infinite graphs (Q949760) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)