scientific article; zbMATH DE number 810055

zbMATH Open0833.05038MaRDI QIDQ4853283FDOQ4853283

Authors:

Publication date: 29 October 1995

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3977027
• Acyclic subgraphs with high chromatic number
• Acyclic subgraphs of tournaments with high chromatic number
• On the Number of Hamiltonian Cycles in a Tournament

zbMATH Keywords

boundstournamentcyclic chromatic number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Score vectors and tournaments with cyclic chromatic number 1 or 2
• Title not available (Why is that?)
• A combinatorial property of the maximum round robin tournament problem
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• Coloring tournaments: from local to global
• A class of tight circulant tournaments
• Acyclic subgraphs of tournaments with high chromatic number
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4853283)