bicritical

bicritical
Describing a graph, the removal of two of whose vertices leaves a subgraph the edges of which can be coloured with only three colours

Wikipedia foundation.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Snark (graph theory) — In graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by three colors without two edges of the… …   Wikipedia

  • Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”