List-colouring Of Graphs — Vizing V0.10 Documentation
Có thể bạn quan tâm
Navigation
- index
- modules |
- next |
- Vizing v0.10 documentation »
Vizing is a collection of Python code for working with list-colouring problems. List vertex-colourings and list edge-colourings are both of interest here. With Vizing you can easily build a variety of models of a list colouring problem instances and use solvers to find realisations of your models.
- Vizing homepage.
- Download the vizing package from the Python Package Index.
- Contribute via the Google Code vizing repository.
Contents:
- Introduction
- Tutorial
- Hall
- Models
- Test functions
- Utilities
- Index
- Module Index
- Search Page
Table Of Contents
- Vizing – list-colouring of graphs
- Indices and tables
Next topic
Introduction
This Page
- Show Source
Quick search
Enter search terms or a module, class or function name.
Navigation
- index
- modules |
- next |
- Vizing v0.10 documentation »
Từ khóa » Vizing
-
Vizing's Theorem - Wikipedia
-
Vizing's Conjecture - Wikipedia
-
Vizing's Theorem - GeeksforGeeks
-
[PDF] Vizing's Theorem And Edge-chromatic Graph Theory
-
Vizing's Theorem - YouTube
-
Vizing's Theorem - YouTube
-
[PDF] Theorem (Vizing's Theorem For Simple Graphs). ∆(G) ≤ χ (G) ≤ ∆(G ...
-
Vizing Theorem - Encyclopedia Of Mathematics
-
Some Applications Of Vizing's Theorem To Vertex Colorings Of Graphs
-
Vizing's And Shannon's Theorems For Defective Edge Colouring - ArXiv
-
(PDF) On Vizing's Conjecture - ResearchGate
-
Double Vizing Fans In Critical Class Two Graphs | Request PDF
-
[PDF] Vizing Theorem