3-minimal triangle-free graphs

DOI10.1016/J.DISC.2014.04.020zbMATH Open1297.05118OpenAlexW2006678284MaRDI QIDQ397131FDOQ397131

Authors: Mohammad Alzohairi, Youssef Boudabbous 

Publication date: 8 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.020

Recommendations

• Triangle-free graphs which are minimal for some nonstable 4-vertex subset
• scientific article; zbMATH DE number 7297127
• Birecognition of prime graphs, and minimal prime graphs
• Primality, criticality and minimality problems in trees
• Recognition of prime graphs from a prime subgraph

zbMATH Keywords

primeisomorphismmodule

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Transitiv orientierbare Graphen
• \(P_ 4\)-trees and substitution decomposition
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Title not available (Why is that?)
• Minimal indecomposable graphs
• A characterization of the indecomposable and infinite graphs
• Primitivity is hereditary for 2-structures

Cited In (6)

• Primality, criticality and minimality problems in trees
• A constructive characterization of 3-connected triangle-free graphs
• Minimum degree of 3-graphs without long linear paths
• Birecognition of prime graphs, and minimal prime graphs
• Triangle-free graphs which are minimal for some nonstable 4-vertex subset
• Minimum number of vertices of almost 3-regular graphs with given deficiency

This page was built for publication: 3-minimal triangle-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397131)