The following pages link to Graph imperfection. I (Q1850556):
Displaying 20 items.
- Flipping triangles and rectangles (Q386439) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- The performance of an upper bound on the fractional chromatic number of weighted graphs (Q968556) (← links)
- The nonidealness index of rank-ideal matrices (Q987680) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Probabilistic refinement of the asymptotic spectrum of graphs (Q2064765) (← links)
- Disproving the normal graph conjecture (Q2222050) (← links)
- Clutter nonidealness (Q2492208) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model (Q2682938) (← links)
- (Q2861537) (← links)
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes (Q3163670) (← links)
- On determining the imperfection ratio (Q3439498) (← links)
- The nonidealness index of circulant matrices (Q3503550) (← links)
- (Q5708482) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5925586) (← links)
