OnlineWoerterBuecher.de - Lexikon, Free On-line Dictionary of Computing



	OnlineWoerterBuecher.de

Navigation

Start

Deutsch-Englisch

Deutsch-Spanisch

Enzyklopädie

Internes

Impressum

Kontakt

Lexikon

chromatic number

S> The SmalleSt number of colourS neceSSary to colour the nodeS of a graph So that no two adjacent nodeS have the Same colour. See alSo: four colour map theorem. {Graph Theory LeSSonS (http://www.utc.edu/~cpmawata/peterSen/leSSon8.htm)}. {Eric WeiSStein' S World Of MathematicS (http://mathworld.wolfram.com/ChromaticNumber.html)}. {The Geometry Center (http://www.geom.umn.edu/~zarembe/grapht1.html)}. (2000-03-18)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ad ] [ adjacent ] [ al ] [ am ] [ ar ] [ arc ] [ at ] [ av ] [ aw ] [ b ] [ be ] [ C ] [ Ch ] [ ch ] [ co ] [ colour ] [ com ] [ de ] [ dj ] [ du ] [ E ] [ ec ] [ ed ] [ edu ] [ ee ] [ er ] [ eS ] [ et ] [ fi ] [ file ] [ fo ] [ four colour map theorem ] [ fr ] [ G ] [ ge ] [ gr ] [ graph ] [ h ] [ hat ] [ hr ] [ ht ] [ id ] [ il ] [ in ] [ iS ] [ ld ] [ Lex ] [ lS ] [ M ] [ ma ] [ mall ] [ map ] [ ml ] [ mn ] [ mo ] [ mod ] [ module ] [ N ] [ na ] [ ne ] [ no ] [ node ] [ nS ] [ nu ] [ O ] [ om ] [ pe ] [ ph ] [ pm ] [ query ] [ rc ] [ re ] [ rl ] [ ro ] [ S ] [ Sa ] [ Sam ] [ Se ] [ Sm ] [ So ] [ St ] [ T ] [ tc ] [ th ] [ tm ] [ to ] [ tp ] [ tr ] [ tt ] [ tw ] [ um ] [ ve ] [ za ] [ ~ ]

[ Go Back ]

Free On-line Dictionary of Computing

	All logos and trademarks in this site are property of their respective owner. Page Generation in 0.078 Seconds, with 17 Database-Queries