scientific article
From MaRDI portal
Publication:3222874
zbMath0558.05036MaRDI QIDQ3222874
Michel Burlet, Jean-Pierre Uhry
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (28)
\(k\)-NLC graphs and polynomial algorithms ⋮ Murky graphs ⋮ Path parity and perfection ⋮ Two-colourings that decompose perfect graphs ⋮ On the optimal transversals of the odd cycles ⋮ Locally perfect graphs ⋮ A fast algorithm for coloring Meyniel graphs ⋮ Parity graphs are kernel-M-solvable ⋮ Connected sequential colourings ⋮ The axiomatic characterization of the interval function of distance hereditary graphs ⋮ Unnamed Item ⋮ Classes of perfect graphs ⋮ Parallel recognition of complement reducible graphs and cotree construction ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ How to compute digraph width measures on directed co-graphs ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Dominating sets in perfect graphs ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ On slim graphs, even pairs, and star-cutsets ⋮ Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph ⋮ Weighted connected domination and Steiner trees in distance-hereditary graphs ⋮ Minimax relations for the partial q-colorings of a graph ⋮ Unavoidable doubly connected large graphs ⋮ The clique operator on cographs and serial graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ On perfectness of sums of graphs ⋮ Perfectly contractile graphs ⋮ On \(m\)-centers in \(P_ t\)-free graphs
This page was built for publication: