scientific article; zbMATH DE number 3286813
From MaRDI portal
Publication:5570136
zbMath0179.29204MaRDI QIDQ5570136
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\), Forbidden induced subgraphs for line graphs, Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected, A note on 3-connected hourglass-free claw-free Hamilton-connected graphs, Fixed-parameter tractability of graph modification problems for hereditary properties, On the problem of how to represent a graph taking into account an additional structure, The partition of a uniform hypergraph into pairs of dependent hyperedges, Claw-free graphs---a survey, The adjacency graphs of a complex, A polynomial characterization of some graph partitioning problems, Graphs with maximal induced matchings of the same size, Recognizing intersection graphs of linear uniform hypergraphs, Graph \(r\)-hued colorings -- a survey, Polynomially determining spanning connectivity of locally connected line graphs, Edge frames of graphs: A graph embedding problem, Applications of edge coloring of multigraphs to vertex coloring of graphs, A note on chromatic number and induced odd cycles, Characterization of common-edge sigraph, Asymptotically sharpening the $s$-Hamiltonian index bound, Exceptional graphs with smallest eigenvalue -2 and related problems, Unnamed Item, Forbidden configurations in intersection graphs of r-graphs, Unnamed Item, Dominoes, Group connectivity and group colorings of graphs --- a survey, On 3-connected Hamiltonian line graphs, Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network, Heredity of the index of convergence of the line digraph, Complexity of representation of graphs by set systems, Group connectivity in line graphs, Connection digraphs and second-order line digraphs, 3-colorability and forbidden subgraphs. I: Characterizing pairs, Intersection graphs of k-uniform linear hypergraphs, Characterization of classical graph classes by weighted clique graphs, A note on line digraphs and the directed max-cut problem, Zero forcing in iterated line digraphs, On minimally circular-imperfect graphs, Hamiltonicity in claw-free graphs, A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of threshold graphs, Edge intersection graphs of linear 3-uniform hypergraphs, Edge intersection graphs of linear 3-uniform hypergraphs, Towards a comprehensive theory of conflict-tolerance graphs, The edge-flipping group of a graph, On the complexity of recognizing directed path families, Functional graphs, A characterization problem on underlying graphs of line digraphs, Graph equations for line graphs and total graphs, Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs, Fusion graphs: merging properties and watersheds, EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED, Representation theorems for graphs whose vertex set is partially ordered, Algorithm for the optimal reconstruction of a digraph, Pancyclicity of claw-free Hamiltonian graphs, Some applications of Vizing's theorem to vertex colorings of graphs, Metric coset schemes revisited, On a problem of walks, Disjoint paired-dominating sets in cubic graphs, Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs, Complete family reduction and spanning connectivity in line graphs, On an edge partition and root graphs of some classes of line graphs, Line graphs and forbidden induced subgraphs, On \(\bullet\)-line signed graphs \(L_\bullet(S)\)
