scientific article; zbMATH DE number 9845

MaRDI QIDQ3971918zbMATH OpenFDO

Authors Marek Kubale

Publication date 25 June 1992

zbMATH Keywords

chromatic indexcaterpillarshairs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• The Proper Interval Colored Graph problem for caterpillar trees
• On the proper intervalization of colored caterpillar trees
• Interval edge-colorings of trees with restrictions on the edges
• The hardness of intervalizing four colored caterpillars
• Edge and total coloring of interval graphs

Cited in

(6)

• The hardness of intervalizing four colored caterpillars
• A linear time algorithm for edge coloring of binomial trees
• Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube
• The complexity of scheduling independent two-processor tasks on dedicated processors
• On the proper intervalization of colored caterpillar trees
• The Proper Interval Colored Graph problem for caterpillar trees

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