Graph imperfection. I
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 1131873 (Why is no real title available?)
- scientific article; zbMATH DE number 1769307 (Why is no real title available?)
- scientific article; zbMATH DE number 1865936 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3893236 (Why is no real title available?)
- (2 + ?)-Coloring of planar graphs with large odd-girth
- 25 pretty graph colouring problems
- A characterization of perfect graphs
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
- Channel assignment and weighted coloring
- Choosability and fractional chromatic numbers
- Corrigendum: Static frequency assignment in cellular networks
- Geometric algorithms and combinatorial optimization
- Graph imperfection and channel assignment
- Graph imperfection. II
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Improving heuristics for the frequency assignment problem
- Line perfect graphs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Multicriterial graph problems with MAXMIN criterion
- Normal hypergraphs and the perfect graph conjecture
- On certain polytopes associated with graphs
- On coloring unit disk graphs
- On the width—length inequality
- Polytope des independants d'un graphe série-parallèle
- Sur le coloriage des graphs
- The Strong Perfect Graph Conjecture for Planar Graphs
- The fractional chromatic number of mycielski's graphs
- Unit disk graphs
Cited in
(23)- Disproving the normal graph conjecture
- scientific article; zbMATH DE number 2230198 (Why is no real title available?)
- The performance of an upper bound on the fractional chromatic number of weighted graphs
- Graph imperfection and channel assignment
- The nonidealness index of rank-ideal matrices
- Characterizing and bounding the imperfection ratio for some classes of graphs
- Distributed coloring and the local structure of unit-disk graphs
- Clutter nonidealness
- A polyhedral approach to the stability of a family of coalitions
- On a certain class of nonideal clutters
- Graph Imperfection with a Co-Site Constraint
- Graph imperfection. II
- Distributed coloring and the local structure of unit-disk graphs
- Comparing imperfection ratio and imperfection index for graph classes
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
- Perfectness and imperfectness of unit disk graphs on triangular lattice points
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
- Constructions for normal graphs and some consequences
- The nonidealness index of circulant matrices
- On determining the imperfection ratio
- Probabilistic refinement of the asymptotic spectrum of graphs
- A comparison between lift-and-project indices and imperfection ratio on web graphs
- Flipping triangles and rectangles
This page was built for publication: Graph imperfection. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850556)
