Hadwiger conjecture (Q1128435)

From Wikidata
Jump to: navigation, search
conjecture that all graphs requiring k or more colors contain a k-vertex complete minor
edit
Language Label Description Also known as
English
Hadwiger conjecture
conjecture that all graphs requiring k or more colors contain a k-vertex complete minor

    Statements

    0 references

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit