Edge-coloring of split graphs.

MaRDI QIDQ2804810zbMATH OpenFDO

Authors Célia P. de Mello, Sheila M. de Almeida, Aurora Morgana

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

split graphedge-coloringpolynomial algorithmclassification problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge Coloring of Split Graphs
• On class 2 split graphs
• Characterizing and edge-colouring split-indifference graphs
• scientific article; zbMATH DE number 749267
• Complexity classification of the edge coloring problem for a family of graph classes

Cited in

(14)

• Edge Coloring of Split Graphs
• Graph edge coloring: a survey
• On colorings of split graphs
• New results on edge-coloring and total-coloring of split graphs
• Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs
• Classifying \(k\)-edge colouring for \(H\)-free graphs
• Decompositions for edge-coloring join graphs and cobipartite graphs
• scientific article; zbMATH DE number 5194482 (Why is no real title available?)
• Graph-Theoretic Concepts in Computer Science
• Complexity classification of the edge coloring problem for a family of graph classes
• Chromatic index of graphs with no cycle with a unique chord
• On split-coloring problems
• On the number of maximal independent sets in minimum colorings of split graphs
• The overfull conjecture on split-comparability and split-interval graphs

This page was built for publication: Edge-coloring of split graphs.

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