The following pages link to (Q4342632):
Displaying 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- The weak 3-flow conjecture and the weak circular flow conjecture (Q412176) (← links)
- 1-planarity of complete multipartite graphs (Q412349) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- Conical and spherical graphs (Q444416) (← links)
- Robust consensus tracking of a class of second-order multi-agent dynamic systems (Q450711) (← links)
- Controlling anonymous mobile agents with unidirectional locomotion to form formations on a circle (Q463874) (← links)
- Finite-time coordination in multiagent systems using sliding mode control approach (Q463906) (← links)
- A revisit to the consensus for linearized Vicsek model under joint rooted leadership via a special matrix (Q480078) (← links)
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\) (Q489721) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- The Cartesian product of cycles with small 2-rainbow domination number (Q498440) (← links)
- Trees and languages with periodic signature (Q505064) (← links)
- Avoiding rainbow 2-connected subgraphs (Q527226) (← links)
- Formation control using range-only measurements (Q534298) (← links)
- On \(H_\infty\) and \(H_2\) performance regions of multi-agent systems (Q534304) (← links)
- Dynamic information handling in continuous time Boolean network model of gene interactions (Q534394) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false (Q598476) (← links)
- On the tropical Torelli map (Q624329) (← links)
- On upper bounds for parameters related to the construction of special maximum matchings (Q658043) (← links)
- Total edge irregularity strength of large graphs (Q658045) (← links)
- Turán numbers for disjoint copies of graphs (Q659740) (← links)
- Geometry of tropical moduli spaces and linkage of graphs (Q662030) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Calculation of the number of all pairs of disjoint S-permutation matrices (Q670673) (← links)
- Comparing perfect and 2nd Voronoi decompositions: the matroidal locus (Q695274) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Strong embeddings of minimum genus (Q709302) (← links)
- The effect of points fattening on postulation (Q710561) (← links)
- Stabilization of sets with application to multi-vehicle coordinated motion (Q710683) (← links)
- The signature of rational languages (Q728282) (← links)
- A matrix-based approach to searching colored paths in a weighted colored multidigraph (Q732496) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Markovian dynamics on complex reaction networks (Q740680) (← links)
- On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
- Characterization of graphs associated with the ideal of numerical semigroups (Q827204) (← links)
- Asymptotic periodicity of recurrent flows in infinite networks (Q834786) (← links)
- Minimum cycle bases of direct products of complete graphs (Q846010) (← links)
- Random talk: Random walk and synchronizability in a moving neighborhood network (Q858514) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- An improved bound for the monochromatic cycle partition number (Q859613) (← links)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs (Q859615) (← links)
- Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
