scientific article; zbMATH DE number 1748997
From MaRDI portal
Publication:4530616
zbMATH Open1007.05002MaRDI QIDQ4530616FDOQ4530616
Authors: Robert A. Wilson 
Publication date: 4 June 2002
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Coloring of graphs and hypergraphs (05C15)
Cited In (21)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
- Diameter of 4-colourable graphs
- Total embedding distributions of Ringel ladders
- Torsion cohomology for solvable groups of finite rank.
- An approximate algorithm for the chromatic number of graphs
- On Barnette's conjecture
- Triangulations of the sphere, bitrades and abelian groups
- Combinatorial stacks and the four-color theorem
- Some properties of non-bicolorable hypergraphs and the four-color problem
- Graph coloring and semidefinite rank
- Metrically homogeneous graphs of diameter \(3\)
- Graph coloring and semidefinite rank
- 3-maps
- Explorations in topology. Map coloring, surfaces and knots
- Combinatorial RNA design: designability and structure-approximating algorithm in Watson-Crick and Nussinov-Jacobson energy models
- Facial non-repetitive edge-coloring of plane graphs
- Coloring graphs with no \(\text{odd-}K_4\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530616)
