The smallest triangle-free 4-chromatic 4-regular graph

Chvátal, V. (1970). The smallest triangle-free 4-chromatic 4-regular graph.

Type

Unclassified

Intellectual base

Unclassified

Year

1970

DOI

10.1016/s0021-9800(70)80057-6

Link

https://doi.org/10.1016/s0021-9800(70)80057-6

Cited by

1 citation across 1 artifact.

Domain-specific

• Quartic graph
  • For example, the distinction between constitutive identity and a convenient observable transfers from The complete graph K5 is quartic because each of its five vertices is adjacent to the other four. to A classification states whether disconnected, infinite, looped or multiedge graphs are allowed..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:41a5e0bba085 · see in the full table