On graphs all of whose \C₃,T₃\-free arc colorations are kernel-perfect

DOI10.7151/DMGT.1134zbMATH Open0990.05060OpenAlexW2090036297MaRDI QIDQ2773044FDOQ2773044

Authors: Hortensia Galeana-Sánchez, José de Jesús García-Ruvalcaba 

Publication date: 24 March 2002

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1134

Recommendations

• Kernels in the closure of coloured digraphs
• Kernels by monochromatic paths and color-perfect digraphs
• Kernels in edge-coloured orientations of nearly complete graphs
• Cycles and transitivity by monochromatic paths in arc-coloured digraphs
• Kernels by monochromatic directed paths in 3-colored tournaments and quasi-tournaments

zbMATH Keywords

kernel-perfect digraph\(m\)-coloured digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cited In (4)

• Kernels in the closure of coloured digraphs
• Kernels in edge-coloured orientations of nearly complete graphs
• New classes of panchromatic digraphs
• Perfect graphs, kernels, and cores of cooperative games

This page was built for publication: On graphs all of whose \(\{C_3,T_3\}\)-free arc colorations are kernel-perfect

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