The following pages link to (Q5668821):
Displayed 42 items.
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks (Q3689205) (← links)
- Ranking the Vertices of a Paired Comparison Digraph (Q3689208) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- A note on strong perfectness of graphs (Q3714102) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- (Q3752378) (← links)
- (Q3762354) (← links)
- (Q3856804) (← links)
- Characterizations of optimal scalings of matrices (Q3878655) (← links)
- On some characterisations of totally unimodular matrices (Q3895600) (← links)
- (Q3898518) (← links)
- (Q3904638) (← links)
- (Q3907583) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- Optimum matching forests II: General weights (Q3922479) (← links)
- (Q3927282) (← links)
- A Combinatorial Proof of the All Minors Matrix Tree Theorem (Q3958479) (← links)
- Covering Regions with Squares (Q3963050) (← links)
- Normalization of place/transition-systems preserves net behaviour (Q3991291) (← links)
- Some results in chromatic scheduling (Q4052161) (← links)
- The Independence Ratio and Genus of a Graph (Q4124854) (← links)
- Line perfect graphs (Q4141848) (← links)
- Maximizing the minimum source-sink path subject to a budget constraint (Q4143044) (← links)
- Compactness and balancing in scheduling (Q4145144) (← links)
- (Q4145732) (← links)
- (Q4281796) (← links)
- Separation Properties for Self-Similar Sets (Q4311379) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- The Hamilton circuit problem on grids (Q4365024) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- Integral decomposition in polyhedra (Q4740329) (← links)
- (Q4740601) (← links)
- On the Exponent of a Primitive, Nearly Reducible Matrix. II (Q4744277) (← links)
- The flow circulation sharing problem (Q4745580) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
- (Q4953539) (← links)
- (Q4953552) (← links)
- (Q4956015) (← links)
- (Q5708545) (← links)
- (Q5708622) (← links)
- Coalitions of arguments: A tool for handling bipolar argumentation frameworks (Q5851696) (← links)
- Broadcasting in random graphs (Q5967062) (← links)