The following pages link to (Q3291034):
Displayed 50 items.
- Bounds of Laplacian spectrum of graphs based on the domination number (Q556910) (← links)
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs (Q595678) (← links)
- Matroids and linking systems (Q599061) (← links)
- Matchings and transversals in hypergraphs, domination and independence in trees (Q599067) (← links)
- On subgraphs in distance-regular graphs (Q685995) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- Bounds relating generalized domination parameters (Q687110) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- The minimum genus of a two-point universal graph (Q755591) (← links)
- Minimum degree of bipartite graphs and the existence of k-factors (Q757438) (← links)
- Path lengths and initial derivatives in arbitrary and Hessenberg compartmental systems (Q758935) (← links)
- Geodetic blocks of diameter three (Q759769) (← links)
- Matching relations and the dimensional structure of social choices (Q760319) (← links)
- Modal logics of domains on the real plane (Q794634) (← links)
- Representation of functional dependencies in relational databases using linear graphs (Q795521) (← links)
- Relations between parameters of a graph (Q802633) (← links)
- A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (Q803164) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- Minimizing the Laplacian eigenvalues for trees with given domination number (Q865427) (← links)
- On strong (weak) independent sets and vertex coverings of a graph (Q870977) (← links)
- Restricted domination in graphs with minimum degree 2 (Q878627) (← links)
- Dominating direct products of graphs (Q879339) (← links)
- Estimations for the domination number of a graph (Q912870) (← links)
- Structural theory of space-time and intrapoint symmetry (Q922560) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- On the domination number of Hamiltonian graphs with minimum degree six (Q952720) (← links)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- Domination in bipartite graphs (Q998499) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- On realizable biorders and the biorder dimension of a relation (Q1057213) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Geodetic graphs of diameter two and some related structures (Q1065024) (← links)
- Whitney's theorem for infinite graphs (Q1065033) (← links)
- Conjugaison par tranches (Q1067593) (← links)
- Some properties of commutation in free partially commutative monoids (Q1068945) (← links)
- A Chvátal-Erdős condition for (1,1)-factors in digraphs (Q1071779) (← links)
- A sufficient condition for oriented graphs to be Hamiltonian (Q1079579) (← links)
- Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem (Q1088910) (← links)
- Characterization of diagrams by 0-1 inequalities (Q1092920) (← links)
- Infimal generators and dualities between complete lattices (Q1099199) (← links)
- Amenable group actions on infinite graphs (Q1105141) (← links)
- A non-covering graph of girth six (Q1106240) (← links)
- Dominating sets in social network graphs (Q1108233) (← links)
- Covering posets (Q1108294) (← links)
- Bigeodetic graphs (Q1110539) (← links)
- A certain combinatorial inequality (Q1121902) (← links)
- The Menger-like property of the three-width of infinite graphs (Q1121910) (← links)