The following pages link to (Q5615282):
Displaying 50 items.
- Planar graphs have independence ratio at least 3/13 (Q311579) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (Q387819) (← links)
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs (Q393157) (← links)
- Minimal strong digraphs (Q409422) (← links)
- The colorful Helly theorem and general hypergraphs (Q412268) (← links)
- A counterexample to sparse removal (Q472399) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Negative local feedbacks in Boolean networks (Q512529) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Skeletal graphs - a new class of perfect graphs (Q582304) (← links)
- Cyclic orders (Q583246) (← links)
- On the identifiability of linear compartmental systems: A revisited transfer function approach based on topological properties (Q594058) (← links)
- Hypernetworks as tools for modelling multiport systems (Q595619) (← links)
- A characterization of the graphs in which the transversal number equals the matching number (Q599828) (← links)
- On mean distance and girth (Q608268) (← links)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
- On the sizes of graphs and their powers: the undirected case (Q643002) (← links)
- New decision rules for exact search in \(N\)-queens (Q652694) (← links)
- Optimal broadcasting in the back to back d-ary trees (Q671386) (← links)
- Medians and centres of polyominoes (Q672091) (← links)
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic (Q686432) (← links)
- Autonomous parts and decomposition of regular tournaments (Q686435) (← links)
- Median graphs, parallelism and posets (Q686442) (← links)
- Bounded vertex colorings of graphs (Q686481) (← links)
- On some partial line graphs of a hypergraph and the associated matroid (Q686485) (← links)
- The cyclic compact open-shop scheduling problem (Q686491) (← links)
- Animaux et arbres guingois. (Animals and guingois trees) (Q688682) (← links)
- Disjoint cycles and spanning graphs of hypercubes (Q704283) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Une classe d'hypergraphes bichromatiques. II (Q759044) (← links)
- An introduction to timetabling (Q759645) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- On shadowed hypergraphs (Q780294) (← links)
- Duality theorems for regular homotopy of finite directed graphs (Q789415) (← links)
- Transversals of circuits and acyclic orientations in graphs and matroids (Q793043) (← links)
- Graphes de cordes et espaces graphiques (Q795063) (← links)
- On a problem of G. Hahn about coloured Hamiltonian paths in \(K_{2n}\) (Q800377) (← links)
- Un problème de connectivité sur les espaces métriques (Q801084) (← links)
- Pancyclism in hamiltonian graphs (Q803159) (← links)
- A bound for the Dilworth number (Q809096) (← links)
- Efficient polynomial algorithms for distributive lattices (Q810071) (← links)
- A convoy scheduling problem (Q811336) (← links)
- Basis graphs of even delta-matroids (Q864897) (← links)
- Hypergraphs and the Clar problem in hexagonal systems (Q865759) (← links)
- All minimal prime extensions of hereditary classes of graphs (Q868943) (← links)
- Global constraint catalogue: past, present and future (Q879974) (← links)
- Generalized Hamming weights and some parameterized codes (Q898145) (← links)
- Bipolarizable graphs (Q912868) (← links)
