Quartic graph: Difference between revisions
Content deleted Content added
m remove Erik9bot category, no longer needed for this article using Project:AWB |
No edit summary |
||
| Line 7: | Line 7: | ||
It is known that quartic graphs have an even number of [[Hamiltonian decomposition]]s. |
It is known that quartic graphs have an even number of [[Hamiltonian decomposition]]s. |
||
==See also== |
|||
*[[Cubic graph]] |
|||
{{DEFAULTSORT:Quartic Graph}} |
{{DEFAULTSORT:Quartic Graph}} |
||
[[Category:Graph families]] |
[[Category:Graph families]] |
||
[[Category:Regular graph]] |
|||
Revision as of 20:56, 8 January 2010
 | This article needs additional citations for verification. (October 2008) |
In the mathematical field of graph theory, a quartic graph is a graph where all vertices have degree 4. In other words a quartic graph is a 4-regular graph.
A biquartic graph is a quartic bipartite graph.
It is an open conjecture that all quartic graphs have an even number of Hamiltonian circuits.
It is known that quartic graphs have an even number of Hamiltonian decompositions.