Abstract
Let D be a digraph. A proper coloring \(\mathcal {C}\) and a path P of D are orthogonal if P contains exactly one vertex of each color class in \(\mathcal {C}\). In 1982, Berge defined the class of \(\chi \)-diperfect digraphs. A digraph D is \(\chi \)-diperfect if for every minimum coloring \(\mathcal {C}\) of D, there exists a path P orthogonal to \(\mathcal {C}\) and this property holds for every induced subdigraph of D. Berge showed that some super-orientations of an odd cycle of length at least five and of its complement are not \(\chi \)-diperfect. In 2022, de Paula Silva, Nunes da Silva and Lee characterized which super-orientations of such graphs are \(\chi \)-diperfect. In this paper, we show that there are other minimal non-\(\chi \)-diperfect digraphs with stability number two and three. In particular, the underlying graph of these digraphs with stability number two that we have found are subgraphs of the complement of an odd cycle with at least seven vertices. Motivated by this fact, we introduce a class of graphs, called nice graphs, which consist of all 2-connected graphs in which every odd cycle has length exactly five. We characterize which super-orientations of the complement of a nice graph are \(\chi \)-diperfect.
Supported by CAPES - Finance Code 001, FAPESP Proc. 2020/06116-4 and 2015/11937-9, and CNPq Proc. 303766/2018-2 and Proc 425340/2016-3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Berge, C.: Diperfect graphs. Combinatorica 2(3), 213–222 (1982)
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Heidelberg (2008)
Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51–229 (2006)
Gallai, T.: Kritische graphen ii. Magyar Tud. Akad. Mat. Kutato Int. Kozl. 8, 373–395 (1963)
Gallai, T.: On directed paths and circuits. In: Theory of Graphs, pp. 115–118 (1968)
Gallai, T., Milgram, A.N.: Verallgemeinerung eines graphentheoretischen Satzes von Rédei. Acta Sci. Math. 21, 181–186 (1960)
Lovász, L.: A note on factor-critical graphs. Studia Sci. Math. Hungar 7(279–280), 11 (1972)
de Paula Silva, C.A.: \(\chi \)-diperfect digraphs. Master’s thesis, State University of Campinas - UNICAMP (2022)
de Paula Silva, C.A., da Silva, C.N., Lee, O.: \(\chi \)-diperfect digraphs. Discret. Math. 345(9), 112941 (2022)
Rédei, L.: Ein kombinatorischer satz. Acta Litt. Szeged 7(39–43), 97 (1934)
Roy, B.: Nombre chromatique et plus longs chemins d’un graphe. ESAIM: Math. Model. Numer. Anal.-Modélisation Mathématique et Analyse Numérique 1(5), 129–132 (1967)
Sambinelli, M.: Partition problems in graphs and digraphs. Ph.D. thesis, State University of Campinas - UNICAMP (2018)
Stehlík, M.: Critical graphs with connected complements. J. Comb. Theory Ser. B 89(2), 189–194 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
de Paula Silva, C.A., da Silva, C.N., Lee, O. (2022). On \(\chi \)-Diperfect Digraphs with Stability Number Two. In: Castañeda, A., Rodríguez-Henríquez, F. (eds) LATIN 2022: Theoretical Informatics. LATIN 2022. Lecture Notes in Computer Science, vol 13568. Springer, Cham. https://doi.org/10.1007/978-3-031-20624-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-031-20624-5_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20623-8
Online ISBN: 978-3-031-20624-5
eBook Packages: Computer ScienceComputer Science (R0)