Chvátal graph
a triangle-free 4-regular 4-chromatic graph with 12 vertices and 24 edges
Press Enter · cited answer in seconds
0 sources
Summary
Chvátal graph is a quartic graph[1]. It draws 95 Wikipedia views per month (quartic_graph category, ranking #1 of 1).[2]
Key Facts
- Chvátal graph is credited with the discovery of Václav Chvátal[3].
- Chvátal graph's instance of is recorded as quartic graph[4].
- Chvátal graph's instance of is recorded as Hamiltonian graph[5].
- Chvátal graph's instance of is recorded as triangle-free graph[6].
- Chvátal graph's instance of is recorded as undirected graph[7].
- Václav Chvátal is named after Chvátal graph[8].
- Chvátal graph's Commons category is recorded as Chvatal graph[9].
- Chvátal graph's studied by is recorded as graph theory[10].
- Chvátal graph's has part is recorded as node[11].
- Chvátal graph's has part is recorded as edge[12].
- Chvátal graph's maintained by WikiProject is recorded as WikiProject Mathematics[13].
- Chvátal graph's graph radius is recorded as {'amount': '+2'}[14].
- Chvátal graph's graph diameter is recorded as {'amount': '+2'}[15].
- Chvátal graph's graph girth is recorded as {'amount': '+4'}[16].
Body
Definition and Type
Recorded instance of include quartic graph[4], Hamiltonian graph[5], triangle-free graph[6], and undirected graph[7].
Origins
Václav Chvátal is named after Chvátal graph[8].
Why It Matters
Chvátal graph draws 95 Wikipedia views per month (quartic_graph category, ranking #1 of 1).[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[17] It is known by 10 alternative names across languages and contexts.[18]