scientific article
From MaRDI portal
Publication:3836509
zbMath0930.05073MaRDI QIDQ3836509
Vassilis Giakoumakis, F. Roussel, Henri Thuillier
Publication date: 9 December 1999
Full work available at URL: https://eudml.org/doc/120093
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (48)
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs ⋮ An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs ⋮ Vizing bound for the chromatic number on some graph classes ⋮ Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ \(P_{4}\)-laden graphs: A new class of brittle graphs ⋮ Some links between identifying codes and separating, dominating and total dominating sets in graphs ⋮ Matroids arisen from matrogenic graphs ⋮ On semi-\(P_ 4\)-sparse graphs ⋮ Scattering number and modular decomposition ⋮ Unnamed Item ⋮ Total dominating sequences in trees, split graphs, and under modular decomposition ⋮ Unnamed Item ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs ⋮ On graphs with a single large Laplacian eigenvalue ⋮ On some graph classes related to perfect graphs: a survey ⋮ The cluster deletion problem for cographs ⋮ On the \(b\)-coloring of \(P_{4}\)-tidy graphs ⋮ Partitioning \(P_4\)-tidy graphs into a stable set and a forest ⋮ On variations of \(P_{4}\)-sparse graphs ⋮ The multiple domination and limited packing problems in graphs ⋮ Classes of perfect graphs ⋮ Counting spanning trees using modular decomposition ⋮ Partial characterizations of circle graphs ⋮ Clique-width of partner-limited graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Restricted coloring problems on graphs with few \(P_4\)'s ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic ⋮ \(b\)-coloring of tight graphs ⋮ Minimal separators in extended \(P_4\)-laden graphs ⋮ Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs ⋮ First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs ⋮ Linear-time modular decomposition of directed graphs ⋮ Hitting subgraphs in \(P_4\)-tidy graphs ⋮ The clique operator on graphs with few \(P_{4}\)'s ⋮ On minimal forbidden subgraph characterizations of balanced graphs ⋮ Bandwidth and topological bandwidth of graphs with few \(P_4\)'s ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Edge tree spanners ⋮ On some special classes of contact \(B_0\)-VPG graphs ⋮ Minimal separators in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-tidy graphs ⋮ Restricted coloring problems on graphs with few ⋮ Probe interval and probe unit interval graphs on superclasses of cographs ⋮ Generalized limited packings of some graphs with a limited number of \(P_4\)-partners ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs ⋮ On -sparse graphs and other families
This page was built for publication:
