scientific article; zbMATH DE number 4160759

zbMATH Open0707.05025MaRDI QIDQ3487366FDOQ3487366

Barry A. Tesman

Publication date: 1990

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

zbMATH Keywords

T-coloringforbidden difference graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (9)

• Divisibility and \(T\)-span of graphs
• \(T\)-colorings, divisibility and the circular chromatic number
• \(T\)-colorings of graphs: recent results and open problems
• A polynomial algorithm for finding \(T\)-span of generalized cacti
• Title not available (Why is that?)
• The complexity of the \(T\)-coloring problem for graphs with small degree
• \(T\)-coloring of certain networks
• \(T\)-colorings of graphs
• List \(T\)-colorings of graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• \(T\)-colorings of graphs: recent results and open problems 👍 👎
• On the use of some known methods for \(T\)-colorings of graphs 👍 👎
• \(T\)-colorings of graphs 👍 👎
• Finite-dimensional \(T\)-colorings of graphs 👍 👎
• Tverberg's theorem and graph coloring 👍 👎
• Forbidden subgraphs of coloring graphs 👍 👎
• Coloring Graphs Characterized by a Forbidden Subgraph 👍 👎
• On coloring digraphs with forbidden induced subgraphs 👍 👎

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 Q3487366)