Characterizing and edge-colouring split-indifference graphs

DOI10.1016/S0166-218X(97)00128-5zbMATH Open0901.05043OpenAlexW1993232133MaRDI QIDQ1383379FDOQ1383379

Authors: Carmen Z. Ortiz, Jayme L. Szwarcfiter, Nelson Maculan 

Publication date: 2 June 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Recommendations

• Edge-coloring of split graphs.
• Edge Coloring of Split Graphs
• Decompositions for the edge colouring of reduced indifference graphs.
• Publication:4508371
• On edge-colouring indifference graphs

zbMATH Keywords

algorithmscharacterizationperfect matchingedge colouringsplit graphschromatic indexindifference graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Cites Work

• On the compatibility between a graph and a simple order
• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Colour Numbers of Complete Graphs
• NP-completeness of edge-colouring some restricted graphs
• On the edge-chromatic number of a graph
• Multicoloring the incidentors of a weighted directed multigraph
• Graphs which are vertex-critical with respect to the edge-chromatic number
• On edge-colouring indifference graphs

Cited In (19)

• On edge-colouring indifference graphs
• Decompositions for the edge colouring of reduced indifference graphs.
• Edge clique partition in \((k,\ell)\)-graphs
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• The overfull conjecture on split-comparability and split-interval graphs
• Edge-coloring of split graphs.
• Chromatic index of graphs with no cycle with a unique chord
• Counting and enumerating unlabeled split-indifference graphs
• On edge-colouring indifference graphs
• Title not available (Why is that?)
• Vector domination in split-indifference graphs
• Partitioning a graph into complementary subgraphs
• New results on edge-coloring and total-coloring of split graphs
• Complexity-separating graph classes for vertex, edge and total colouring
• Classifying \(k\)-edge colouring for \(H\)-free graphs
• Edge Coloring of Split Graphs
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
• Edge-colouring and total-colouring chordless graphs
• The total chromatic number of split-indifference graphs

This page was built for publication: Characterizing and edge-colouring split-indifference graphs

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