The following pages link to (Q4208001):
Displaying 41 items.
- On a conjecture of Füredi. (Q2349954) (← links)
- Further results on the deficiency of graphs (Q2357781) (← links)
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs (Q2401803) (← links)
- Generic pole assignability, structurally constrained controllers and unimodular completion (Q2435587) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- A note on graphs contraction-critical with respect to independence number (Q2449144) (← links)
- Consecutive edge-coloring of the generalized \(\theta \)-graph (Q2457013) (← links)
- The computational complexity of the parallel knock-out problem (Q2481963) (← links)
- Cycle double covers and spanning minors. I (Q2490249) (← links)
- Level of repair analysis and minimum cost homomorphisms of graphs (Q2492189) (← links)
- On the Hamiltonicity of random bipartite graphs (Q2628103) (← links)
- One-sided interval edge-colorings of bipartite graphs (Q2629271) (← links)
- Constructions of binary codes based on bipartite graphs (Q2630779) (← links)
- Chordal multipartite graphs and chordal colorings (Q2643326) (← links)
- A note on one-sided interval edge colorings of bipartite graphs (Q2666587) (← links)
- On universal positive graphs (Q2687461) (← links)
- A Note on the Existence of All (g,f)-Factors (Q2985119) (← links)
- Stochastic forms of non-negative matrices and Perron-regularity (Q3186708) (← links)
- Borel oracles. An analytical approach to constant-time algorithms (Q3581114) (← links)
- Deep graphs—A general framework to represent and analyze heterogeneous complex systems across scales (Q4591846) (← links)
- (Q4637130) (← links)
- Avoiding Arrays of Odd Order by Latin Squares (Q4911169) (← links)
- On Co-complete<i>k</i>–partite Graph Valued Functions (Q5069775) (← links)
- LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS (Q5100179) (← links)
- Independence and matching numbers of some token graphs (Q5109075) (← links)
- Bipartite graphs as polynomials and polynomials as bipartite graphs (Q5162789) (← links)
- Matchings in connection with ground delay program planning (Q5191150) (← links)
- Restricted completion of sparse partial Latin squares (Q5222548) (← links)
- Majorization and distances in trees (Q5434592) (← links)
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs (Q5495881) (← links)
- (Q5708599) (← links)
- Bicolored matchings in some classes of graphs (Q5899324) (← links)
- Bicolored matchings in some classes of graphs (Q5899373) (← links)
- NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)
- Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs (Q6063139) (← links)
- Continuous 2-colorings and topological dynamics (Q6064217) (← links)
- Uniform chain decompositions and applications (Q6074684) (← links)
- Interval colorings of graphs—Coordinated and unstable no‐wait schedules (Q6084715) (← links)
- Synchronization of oscillators not sharing a common ground (Q6164058) (← links)
- Consensus of networked double integrator systems under sensor bias (Q6496772) (← links)
