A characterization of uniquely 2-list colorable graphs

zbMATH Open0977.05046MaRDI QIDQ2761069FDOQ2761069

Mohammad Mahdian, E. S. Mahmoodian

Publication date: 17 December 2001

Published in: Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

list coloringuniquely 2-colorable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (14)

• Unique list-colourability and the fixing chromatic number of graphs
• Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints
• Using local search to speed up filtering algorithms for some NP-hard constraints
• Uniquely 2-list colorable graphs
• A relation between choosability and uniquely list colorability
• On uniquely \(k\)-list colorable planar graphs, graphs on surfaces, and regular graphs
• Colorings of the Graph K ᵐ 2 + Kn
• On defining numbers of vertex colouring of regular graphs
• Some Conjectures and Questions in Chromatic Topological Graph Theory
• Unique list colorability of the graph Кn2 + Kr
• Title not available (Why is that?)
• Note on property \(M(k)\) of some complete multipartite graphs
• The chromaticity of complete split graphs
• Complexity of unique list colorability

   Recommendations

• Uniquely 2-list colorable graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs 👍 👎
• Complexity of unique list colorability 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A characterization of uniquely 2-list colorable graphs

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