The following pages link to (Q4208001):
Displaying 50 items.
- Interval cyclic edge-colorings of graphs (Q279196) (← links)
- How many TCR clonotypes does a body maintain? (Q304769) (← links)
- Bipartite opinion forming: towards consensus over coopetition networks (Q341443) (← links)
- The minimum maximal k-partial-matching problem (Q395867) (← links)
- A note on upper bounds for the maximum span in interval edge-colorings of graphs (Q408172) (← links)
- On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
- On the intricacy of avoiding multiple-entry arrays (Q456895) (← links)
- Bipartite partial duals and circuits in medial graphs (Q485497) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Interval edge-colorings of composition of graphs (Q516842) (← links)
- Spectra of conic carbon radicals (Q551841) (← links)
- A generalization of interval edge-colorings of graphs (Q602763) (← links)
- On resistance of graphs (Q643030) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- On avoiding some families of arrays (Q764884) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs (Q882116) (← links)
- A network game with attackers and a defender (Q930603) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes (Q968437) (← links)
- Process flexibility: design, evaluation, and applications (Q971985) (← links)
- Partial cubes: Structures, characterizations, and constructions (Q998441) (← links)
- On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
- Upper bounds on ATSP neighborhood size. (Q1406047) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- Partitioning the Boolean lattice into chains of large minimum size (Q1604571) (← links)
- Flow distances on open flow networks (Q1618721) (← links)
- Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs (Q1690222) (← links)
- Relating zeta functions of discrete and quantum graphs (Q1696034) (← links)
- Some properties of graphs constructed from 2-designs (Q1733436) (← links)
- The normalized Laplacian spectrum of subdivisions of a graph (Q1733531) (← links)
- Path colorings in bipartite graphs (Q1767676) (← links)
- A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
- Majorization-constrained doubly stochastic matrices (Q1863545) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- Locally finite homogeneous graphs (Q1945276) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- Graphs with few distinct eigenvalues and extremal energy (Q2020686) (← links)
- Distributed branch points and the shape of elastic surfaces with constant negative curvature (Q2022605) (← links)
- Cyclic deficiency of graphs (Q2026336) (← links)
- Using the classical model for source attribution of pathogen-caused illnesses. Lessons from conducting an ample structured expert judgment study (Q2086367) (← links)
- The many facets of the Estrada indices of graphs and networks (Q2128861) (← links)
- A passivity-based approach to voltage stabilization in DC microgrids with ZIP loads (Q2173948) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs (Q2227978) (← links)
- Improper interval edge colorings of graphs (Q2235270) (← links)
- Consecutive colouring of oriented graphs (Q2242444) (← links)
- Pell graphs (Q2319726) (← links)
- Eigenvector-based identification of bipartite subgraphs (Q2328104) (← links)
