Clique-transversal sets of line graphs and complements of line graphs
From MaRDI portal
Publication:810533
DOI10.1016/0012-365X(91)90055-7zbMath0734.05077MaRDI QIDQ810533
Thomas Andreae, Martin Schughart, Zsolt Tuza
Publication date: 1991
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (43)
Clique-coloring of \(K_{3,3}\)-minor free graphs ⋮ Structural parameterizations of clique coloring ⋮ Fibres of width 3 ordered sets ⋮ Clique-coloring claw-free graphs ⋮ Subgraph transversal of graphs ⋮ The algorithmic complexity of the minus clique-transversal problem ⋮ The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs ⋮ On covering all cliques of a chordal graph ⋮ Clique-transversal number of graphs whose clique-graphs are trees ⋮ Coloring the cliques of line graphs ⋮ Covering and independence in triangle structures ⋮ Algorithmic aspects of the generalized clique-transversal problem on chordal graphs ⋮ Tight asymptotics of clique‐chromatic numbers of dense random graphs ⋮ The jump of the clique chromatic number of random graphs ⋮ Unnamed Item ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ Perfect graphs of arbitrarily large clique-chromatic number ⋮ Weighted maximum-clique transversal sets of graphs ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Covering all cliques of a graph ⋮ On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs ⋮ Algorithmic aspects of clique-transversal and clique-independent sets ⋮ The clique-transversal set problem in claw-free graphs with degree at most 4 ⋮ Clique colourings of geometric graphs ⋮ Bounds on the clique-transversal number of regular graphs ⋮ The signed maximum-clique transversal number of regular graphs ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ The geodesic-transversal problem ⋮ Covering the cliques of a graph with vertices ⋮ Claw-free cubic graphs with clique-transversal number half of their order ⋮ Distance-hereditary graphs are clique-perfect ⋮ Unnamed Item ⋮ Signed clique-transversal functions in graphs ⋮ Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ On the complexity of local-equitable coloring of graphs ⋮ The clique-perfectness and clique-coloring of outer-planar graphs ⋮ On the clique-transversal number of chordal graphs ⋮ On ordered sets without 2-colourings ⋮ Hitting all maximal independent sets of a bipartite graph
Cites Work
This page was built for publication: Clique-transversal sets of line graphs and complements of line graphs
